/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/pthread-wmm/mix051_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:31:52,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:31:52,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:31:52,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:31:52,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:31:52,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:31:52,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:31:52,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:31:52,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:31:52,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:31:52,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:31:52,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:31:52,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:31:52,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:31:52,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:31:52,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:31:52,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:31:52,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:31:52,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:31:52,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:31:52,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:31:52,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:31:52,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:31:52,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:31:52,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:31:52,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:31:52,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:31:52,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:31:52,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:31:52,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:31:52,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:31:52,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:31:52,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:31:52,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:31:52,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:31:52,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:31:52,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:31:52,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:31:52,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:31:52,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:31:52,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:31:52,966 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 13:31:52,992 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:31:52,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:31:52,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:31:52,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:31:52,995 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:31:52,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:31:52,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:31:52,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:31:52,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:31:52,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:31:52,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:31:52,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:31:52,997 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:31:52,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:31:52,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:31:52,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:31:52,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:31:52,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:31:52,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:31:52,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:31:52,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:31:52,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:31:52,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:31:52,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:31:52,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:31:52,999 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 13:31:53,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:31:53,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:31:53,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:31:53,416 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:31:53,417 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:31:53,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2020-12-23 13:31:53,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3b1ed1a75/e38d74886f5b4f2cb27a91f098d20f72/FLAG0867d8237 [2020-12-23 13:31:54,154 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:31:54,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt.i [2020-12-23 13:31:54,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3b1ed1a75/e38d74886f5b4f2cb27a91f098d20f72/FLAG0867d8237 [2020-12-23 13:31:54,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3b1ed1a75/e38d74886f5b4f2cb27a91f098d20f72 [2020-12-23 13:31:54,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:31:54,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:31:54,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:31:54,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:31:54,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:31:54,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:31:54" (1/1) ... [2020-12-23 13:31:54,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cd71e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:54, skipping insertion in model container [2020-12-23 13:31:54,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:31:54" (1/1) ... [2020-12-23 13:31:54,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:31:54,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:31:54,684 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/pthread-wmm/mix051_pso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:31:54,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:31:54,948 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:31:54,965 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/pthread-wmm/mix051_pso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2020-12-23 13:31:55,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:31:55,156 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:31:55,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55 WrapperNode [2020-12-23 13:31:55,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:31:55,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:31:55,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:31:55,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:31:55,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:31:55,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:31:55,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:31:55,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:31:55,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (1/1) ... [2020-12-23 13:31:55,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:31:55,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:31:55,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:31:55,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:31:55,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (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 13:31:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:31:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:31:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:31:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:31:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:31:55,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:31:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:31:55,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:31:55,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-23 13:31:55,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-23 13:31:55,438 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-23 13:31:55,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-23 13:31:55,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:31:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:31:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:31:55,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:31:55,441 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:31:57,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:31:57,746 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 13:31:57,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:31:57 BoogieIcfgContainer [2020-12-23 13:31:57,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:31:57,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:31:57,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:31:57,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:31:57,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:31:54" (1/3) ... [2020-12-23 13:31:57,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7771c7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:31:57, skipping insertion in model container [2020-12-23 13:31:57,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:31:55" (2/3) ... [2020-12-23 13:31:57,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7771c7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:31:57, skipping insertion in model container [2020-12-23 13:31:57,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:31:57" (3/3) ... [2020-12-23 13:31:57,765 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt.i [2020-12-23 13:31:57,773 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:31:57,774 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:31:57,779 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 13:31:57,780 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:31:57,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,841 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,845 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,848 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,848 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,885 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,885 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,888 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,888 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,888 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,889 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,890 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,891 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,892 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,901 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,904 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,908 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,909 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:31:57,912 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:31:57,933 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 13:31:57,974 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:31:57,974 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:31:57,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:31:57,975 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:31:57,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:31:57,976 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:31:57,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:31:57,976 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:31:57,990 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:31:57,993 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-23 13:31:57,996 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 246 flow [2020-12-23 13:31:57,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-12-23 13:31:58,063 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-12-23 13:31:58,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:31:58,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-12-23 13:31:58,075 INFO L116 LiptonReduction]: Number of co-enabled transitions 2300 [2020-12-23 13:31:58,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:31:58,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:58,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:31:58,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:31:59,314 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-23 13:31:59,420 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 13:32:00,078 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-23 13:32:00,331 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-23 13:32:00,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:00,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:00,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:00,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:00,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:00,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:00,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:00,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:00,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:00,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:00,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:00,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:00,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:00,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:00,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:00,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:00,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:00,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:00,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:32:00,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:01,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:01,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:01,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:01,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:01,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:01,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:01,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:01,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:01,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:01,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:01,020 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:01,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:01,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:01,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:01,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:01,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:01,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:01,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:01,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:32:01,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:32:02,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:02,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:02,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:02,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:02,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:02,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:02,899 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 13:32:03,026 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-23 13:32:03,580 WARN L197 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2020-12-23 13:32:03,851 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-12-23 13:32:03,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:03,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:03,998 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:03,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:04,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:04,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:04,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:32:04,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-23 13:32:04,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:32:04,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:32:04,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:04,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:04,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:04,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:32:04,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-23 13:32:04,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:32:04,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:04,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-23 13:32:04,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:05,035 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-23 13:32:05,206 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-23 13:32:05,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:05,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:05,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:05,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:05,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:05,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:05,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:05,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:05,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:06,046 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-23 13:32:06,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:06,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:06,162 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:06,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:32:06,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:06,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:32:06,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:06,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:32:06,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:32:07,496 WARN L197 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-23 13:32:07,760 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-23 13:32:08,327 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-23 13:32:08,582 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-23 13:32:08,590 INFO L131 LiptonReduction]: Checked pairs total: 5480 [2020-12-23 13:32:08,590 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-12-23 13:32:08,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-12-23 13:32:08,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-12-23 13:32:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-12-23 13:32:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-23 13:32:08,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:08,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:32:08,749 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 333670476, now seen corresponding path program 1 times [2020-12-23 13:32:08,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:08,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310259507] [2020-12-23 13:32:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:09,119 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 13:32:09,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310259507] [2020-12-23 13:32:09,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:09,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:32:09,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990372815] [2020-12-23 13:32:09,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:32:09,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:32:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:32:09,147 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-12-23 13:32:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:09,254 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-12-23 13:32:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:32:09,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-23 13:32:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:09,297 INFO L225 Difference]: With dead ends: 1770 [2020-12-23 13:32:09,297 INFO L226 Difference]: Without dead ends: 1450 [2020-12-23 13:32:09,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:32:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-12-23 13:32:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-12-23 13:32:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-12-23 13:32:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-12-23 13:32:09,482 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-12-23 13:32:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:09,483 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-12-23 13:32:09,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:32:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-12-23 13:32:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 13:32:09,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:09,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:32:09,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:32:09,490 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1465222219, now seen corresponding path program 1 times [2020-12-23 13:32:09,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:09,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239598431] [2020-12-23 13:32:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:09,709 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 13:32:09,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239598431] [2020-12-23 13:32:09,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:09,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:32:09,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294673049] [2020-12-23 13:32:09,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:32:09,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:32:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:32:09,712 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-12-23 13:32:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:09,758 INFO L93 Difference]: Finished difference Result 2110 states and 7474 transitions. [2020-12-23 13:32:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:32:09,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-23 13:32:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:09,781 INFO L225 Difference]: With dead ends: 2110 [2020-12-23 13:32:09,781 INFO L226 Difference]: Without dead ends: 2038 [2020-12-23 13:32:09,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 13:32:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2020-12-23 13:32:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1886. [2020-12-23 13:32:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2020-12-23 13:32:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6814 transitions. [2020-12-23 13:32:09,890 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6814 transitions. Word has length 11 [2020-12-23 13:32:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:09,891 INFO L481 AbstractCegarLoop]: Abstraction has 1886 states and 6814 transitions. [2020-12-23 13:32:09,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:32:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6814 transitions. [2020-12-23 13:32:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:32:09,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:09,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:32:09,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:32:09,902 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1290388431, now seen corresponding path program 1 times [2020-12-23 13:32:09,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:09,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687952676] [2020-12-23 13:32:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:10,080 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 13:32:10,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687952676] [2020-12-23 13:32:10,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:10,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:32:10,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114112223] [2020-12-23 13:32:10,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:32:10,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:10,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:32:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:32:10,084 INFO L87 Difference]: Start difference. First operand 1886 states and 6814 transitions. Second operand 4 states. [2020-12-23 13:32:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:10,194 INFO L93 Difference]: Finished difference Result 1962 states and 6428 transitions. [2020-12-23 13:32:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:32:10,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 13:32:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:10,213 INFO L225 Difference]: With dead ends: 1962 [2020-12-23 13:32:10,214 INFO L226 Difference]: Without dead ends: 1514 [2020-12-23 13:32:10,214 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 13:32:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2020-12-23 13:32:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2020-12-23 13:32:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1514 states. [2020-12-23 13:32:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 4958 transitions. [2020-12-23 13:32:10,308 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 4958 transitions. Word has length 12 [2020-12-23 13:32:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:10,308 INFO L481 AbstractCegarLoop]: Abstraction has 1514 states and 4958 transitions. [2020-12-23 13:32:10,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:32:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 4958 transitions. [2020-12-23 13:32:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 13:32:10,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:10,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:32:10,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:32:10,313 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1359649850, now seen corresponding path program 1 times [2020-12-23 13:32:10,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:10,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617176419] [2020-12-23 13:32:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:10,475 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 13:32:10,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617176419] [2020-12-23 13:32:10,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:10,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:32:10,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235662987] [2020-12-23 13:32:10,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:32:10,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:10,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:32:10,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:32:10,479 INFO L87 Difference]: Start difference. First operand 1514 states and 4958 transitions. Second operand 5 states. [2020-12-23 13:32:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:10,567 INFO L93 Difference]: Finished difference Result 1307 states and 3875 transitions. [2020-12-23 13:32:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:32:10,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-23 13:32:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:10,578 INFO L225 Difference]: With dead ends: 1307 [2020-12-23 13:32:10,578 INFO L226 Difference]: Without dead ends: 997 [2020-12-23 13:32:10,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:32:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-12-23 13:32:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 977. [2020-12-23 13:32:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-12-23 13:32:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2834 transitions. [2020-12-23 13:32:10,621 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2834 transitions. Word has length 14 [2020-12-23 13:32:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:10,623 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 2834 transitions. [2020-12-23 13:32:10,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:32:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2834 transitions. [2020-12-23 13:32:10,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 13:32:10,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:10,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:32:10,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:32:10,627 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1128358290, now seen corresponding path program 1 times [2020-12-23 13:32:10,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:10,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377363065] [2020-12-23 13:32:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:10,743 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 13:32:10,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377363065] [2020-12-23 13:32:10,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:10,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:32:10,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938565429] [2020-12-23 13:32:10,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:32:10,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:10,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:32:10,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:32:10,747 INFO L87 Difference]: Start difference. First operand 977 states and 2834 transitions. Second operand 6 states. [2020-12-23 13:32:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:10,831 INFO L93 Difference]: Finished difference Result 837 states and 2376 transitions. [2020-12-23 13:32:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:32:10,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-23 13:32:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:10,838 INFO L225 Difference]: With dead ends: 837 [2020-12-23 13:32:10,838 INFO L226 Difference]: Without dead ends: 720 [2020-12-23 13:32:10,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-23 13:32:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-23 13:32:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 624. [2020-12-23 13:32:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2020-12-23 13:32:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1787 transitions. [2020-12-23 13:32:10,862 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1787 transitions. Word has length 17 [2020-12-23 13:32:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:10,862 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 1787 transitions. [2020-12-23 13:32:10,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:32:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1787 transitions. [2020-12-23 13:32:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-23 13:32:10,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:10,865 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] [2020-12-23 13:32:10,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:32:10,865 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:10,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1282915133, now seen corresponding path program 1 times [2020-12-23 13:32:10,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:10,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902084650] [2020-12-23 13:32:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:10,973 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 13:32:10,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902084650] [2020-12-23 13:32:10,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:10,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:32:10,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090811466] [2020-12-23 13:32:10,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:32:10,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:32:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:32:10,976 INFO L87 Difference]: Start difference. First operand 624 states and 1787 transitions. Second operand 7 states. [2020-12-23 13:32:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:11,078 INFO L93 Difference]: Finished difference Result 593 states and 1724 transitions. [2020-12-23 13:32:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:32:11,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-23 13:32:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:11,083 INFO L225 Difference]: With dead ends: 593 [2020-12-23 13:32:11,083 INFO L226 Difference]: Without dead ends: 549 [2020-12-23 13:32:11,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-12-23 13:32:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-12-23 13:32:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 469. [2020-12-23 13:32:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2020-12-23 13:32:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1395 transitions. [2020-12-23 13:32:11,101 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1395 transitions. Word has length 20 [2020-12-23 13:32:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:11,102 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 1395 transitions. [2020-12-23 13:32:11,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:32:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1395 transitions. [2020-12-23 13:32:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:11,104 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:11,104 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] [2020-12-23 13:32:11,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:32:11,105 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:11,105 INFO L82 PathProgramCache]: Analyzing trace with hash -996640531, now seen corresponding path program 1 times [2020-12-23 13:32:11,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:11,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451551016] [2020-12-23 13:32:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:11,256 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 13:32:11,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451551016] [2020-12-23 13:32:11,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:11,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:32:11,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042978694] [2020-12-23 13:32:11,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:32:11,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:11,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:32:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:32:11,259 INFO L87 Difference]: Start difference. First operand 469 states and 1395 transitions. Second operand 4 states. [2020-12-23 13:32:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:11,307 INFO L93 Difference]: Finished difference Result 715 states and 2077 transitions. [2020-12-23 13:32:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:32:11,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-23 13:32:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:11,313 INFO L225 Difference]: With dead ends: 715 [2020-12-23 13:32:11,313 INFO L226 Difference]: Without dead ends: 593 [2020-12-23 13:32:11,314 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 13:32:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-12-23 13:32:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 405. [2020-12-23 13:32:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2020-12-23 13:32:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1163 transitions. [2020-12-23 13:32:11,329 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 1163 transitions. Word has length 24 [2020-12-23 13:32:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:11,330 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 1163 transitions. [2020-12-23 13:32:11,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:32:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1163 transitions. [2020-12-23 13:32:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:11,331 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:11,332 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] [2020-12-23 13:32:11,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:32:11,332 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:11,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 845248617, now seen corresponding path program 2 times [2020-12-23 13:32:11,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:11,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277120821] [2020-12-23 13:32:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:11,462 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 13:32:11,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277120821] [2020-12-23 13:32:11,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:11,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:32:11,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548115802] [2020-12-23 13:32:11,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:32:11,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:32:11,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:32:11,465 INFO L87 Difference]: Start difference. First operand 405 states and 1163 transitions. Second operand 5 states. [2020-12-23 13:32:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:11,529 INFO L93 Difference]: Finished difference Result 691 states and 1937 transitions. [2020-12-23 13:32:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:32:11,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-23 13:32:11,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:11,535 INFO L225 Difference]: With dead ends: 691 [2020-12-23 13:32:11,535 INFO L226 Difference]: Without dead ends: 291 [2020-12-23 13:32:11,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:32:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-12-23 13:32:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 231. [2020-12-23 13:32:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-12-23 13:32:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 605 transitions. [2020-12-23 13:32:11,548 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 605 transitions. Word has length 24 [2020-12-23 13:32:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:11,549 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 605 transitions. [2020-12-23 13:32:11,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:32:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 605 transitions. [2020-12-23 13:32:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:11,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:11,551 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] [2020-12-23 13:32:11,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:32:11,551 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash 936047199, now seen corresponding path program 3 times [2020-12-23 13:32:11,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:11,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286667922] [2020-12-23 13:32:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:11,678 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 13:32:11,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286667922] [2020-12-23 13:32:11,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:11,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:32:11,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115685629] [2020-12-23 13:32:11,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:32:11,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:11,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:32:11,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:32:11,682 INFO L87 Difference]: Start difference. First operand 231 states and 605 transitions. Second operand 4 states. [2020-12-23 13:32:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:11,773 INFO L93 Difference]: Finished difference Result 305 states and 793 transitions. [2020-12-23 13:32:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:32:11,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-23 13:32:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:11,775 INFO L225 Difference]: With dead ends: 305 [2020-12-23 13:32:11,775 INFO L226 Difference]: Without dead ends: 145 [2020-12-23 13:32:11,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:32:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-12-23 13:32:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-12-23 13:32:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-23 13:32:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 351 transitions. [2020-12-23 13:32:11,780 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 351 transitions. Word has length 24 [2020-12-23 13:32:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:11,781 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 351 transitions. [2020-12-23 13:32:11,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:32:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 351 transitions. [2020-12-23 13:32:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:11,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:11,782 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] [2020-12-23 13:32:11,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:32:11,782 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1482739699, now seen corresponding path program 4 times [2020-12-23 13:32:11,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:11,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747563846] [2020-12-23 13:32:11,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:11,894 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 13:32:11,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747563846] [2020-12-23 13:32:11,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:11,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:32:11,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696451073] [2020-12-23 13:32:11,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:32:11,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:32:11,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:32:11,897 INFO L87 Difference]: Start difference. First operand 145 states and 351 transitions. Second operand 4 states. [2020-12-23 13:32:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:11,915 INFO L93 Difference]: Finished difference Result 183 states and 437 transitions. [2020-12-23 13:32:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 13:32:11,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-23 13:32:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:11,917 INFO L225 Difference]: With dead ends: 183 [2020-12-23 13:32:11,917 INFO L226 Difference]: Without dead ends: 79 [2020-12-23 13:32:11,917 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 13:32:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-23 13:32:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-23 13:32:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-23 13:32:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-12-23 13:32:11,920 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-12-23 13:32:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:11,921 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-12-23 13:32:11,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:32:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-12-23 13:32:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:11,923 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:11,923 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] [2020-12-23 13:32:11,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:32:11,923 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:11,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:11,924 INFO L82 PathProgramCache]: Analyzing trace with hash -191364127, now seen corresponding path program 5 times [2020-12-23 13:32:11,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:11,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598165917] [2020-12-23 13:32:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:32:12,114 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 13:32:12,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598165917] [2020-12-23 13:32:12,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:32:12,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:32:12,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543103687] [2020-12-23 13:32:12,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:32:12,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:32:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:32:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:32:12,116 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 5 states. [2020-12-23 13:32:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:32:12,170 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-12-23 13:32:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:32:12,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-12-23 13:32:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:32:12,172 INFO L225 Difference]: With dead ends: 97 [2020-12-23 13:32:12,172 INFO L226 Difference]: Without dead ends: 51 [2020-12-23 13:32:12,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:32:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-23 13:32:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-23 13:32:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-23 13:32:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-12-23 13:32:12,175 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-12-23 13:32:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:32:12,175 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-12-23 13:32:12,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:32:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-12-23 13:32:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 13:32:12,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:32:12,177 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] [2020-12-23 13:32:12,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:32:12,177 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:32:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:32:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash 166698551, now seen corresponding path program 6 times [2020-12-23 13:32:12,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:32:12,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976323409] [2020-12-23 13:32:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:32:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:32:12,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:32:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:32:12,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:32:12,320 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:32:12,320 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:32:12,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:32:12,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:32:12 BasicIcfg [2020-12-23 13:32:12,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:32:12,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:32:12,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:32:12,473 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:32:12,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:31:57" (3/4) ... [2020-12-23 13:32:12,476 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:32:12,660 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix051_pso.opt.i-witness.graphml [2020-12-23 13:32:12,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:32:12,662 INFO L168 Benchmark]: Toolchain (without parser) took 18223.97 ms. Allocated memory was 157.3 MB in the beginning and 367.0 MB in the end (delta: 209.7 MB). Free memory was 130.5 MB in the beginning and 222.0 MB in the end (delta: -91.6 MB). Peak memory consumption was 118.8 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,667 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 157.3 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:32:12,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.38 ms. Allocated memory is still 157.3 MB. Free memory was 130.2 MB in the beginning and 133.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 35.0 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.80 ms. Allocated memory is still 157.3 MB. Free memory was 133.7 MB in the beginning and 131.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,668 INFO L168 Benchmark]: Boogie Preprocessor took 83.53 ms. Allocated memory is still 157.3 MB. Free memory was 131.3 MB in the beginning and 129.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,668 INFO L168 Benchmark]: RCFGBuilder took 2437.76 ms. Allocated memory was 157.3 MB in the beginning and 189.8 MB in the end (delta: 32.5 MB). Free memory was 129.2 MB in the beginning and 159.0 MB in the end (delta: -29.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,669 INFO L168 Benchmark]: TraceAbstraction took 14719.36 ms. Allocated memory was 189.8 MB in the beginning and 367.0 MB in the end (delta: 177.2 MB). Free memory was 158.4 MB in the beginning and 242.0 MB in the end (delta: -83.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,669 INFO L168 Benchmark]: Witness Printer took 188.17 ms. Allocated memory is still 367.0 MB. Free memory was 242.0 MB in the beginning and 222.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-23 13:32:12,673 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.22 ms. Allocated memory is still 157.3 MB. Free memory is still 128.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 714.38 ms. Allocated memory is still 157.3 MB. Free memory was 130.2 MB in the beginning and 133.7 MB in the end (delta: -3.4 MB). Peak memory consumption was 35.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.80 ms. Allocated memory is still 157.3 MB. Free memory was 133.7 MB in the beginning and 131.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.53 ms. Allocated memory is still 157.3 MB. Free memory was 131.3 MB in the beginning and 129.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2437.76 ms. Allocated memory was 157.3 MB in the beginning and 189.8 MB in the end (delta: 32.5 MB). Free memory was 129.2 MB in the beginning and 159.0 MB in the end (delta: -29.8 MB). Peak memory consumption was 100.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14719.36 ms. Allocated memory was 189.8 MB in the beginning and 367.0 MB in the end (delta: 177.2 MB). Free memory was 158.4 MB in the beginning and 242.0 MB in the end (delta: -83.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 8.0 GB. * Witness Printer took 188.17 ms. Allocated memory is still 367.0 MB. Free memory was 242.0 MB in the beginning and 222.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1546 VarBasedMoverChecksPositive, 76 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 183 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.5s, 124 PlacesBefore, 43 PlacesAfterwards, 113 TransitionsBefore, 30 TransitionsAfterwards, 2300 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5480 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 323 SDtfs, 475 SDslu, 477 SDs, 0 SdLazy, 150 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 596 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 18318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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...