/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/mix034_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:20:28,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:20:28,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:20:29,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:20:29,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:20:29,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:20:29,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:20:29,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:20:29,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:20:29,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:20:29,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:20:29,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:20:29,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:20:29,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:20:29,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:20:29,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:20:29,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:20:29,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:20:29,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:20:29,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:20:29,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:20:29,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:20:29,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:20:29,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:20:29,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:20:29,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:20:29,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:20:29,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:20:29,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:20:29,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:20:29,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:20:29,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:20:29,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:20:29,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:20:29,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:20:29,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:20:29,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:20:29,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:20:29,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:20:29,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:20:29,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:20:29,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:20:29,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:20:29,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:20:29,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:20:29,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:20:29,123 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:20:29,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:20:29,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:20:29,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:20:29,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:20:29,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:20:29,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:20:29,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:20:29,125 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:20:29,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:20:29,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:20:29,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:20:29,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:20:29,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:20:29,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:20:29,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:20:29,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:20:29,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:20:29,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:20:29,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:20:29,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:20:29,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:20:29,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:20:29,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:20:29,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:20:29,612 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:20:29,612 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:20:29,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2021-01-06 23:20:29,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9016700d4/ba1c091fcb4e44eb8941301ac9eb458b/FLAG7aa61477a [2021-01-06 23:20:30,625 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:20:30,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_power.opt.i [2021-01-06 23:20:30,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9016700d4/ba1c091fcb4e44eb8941301ac9eb458b/FLAG7aa61477a [2021-01-06 23:20:30,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9016700d4/ba1c091fcb4e44eb8941301ac9eb458b [2021-01-06 23:20:30,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:20:30,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:20:30,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:20:30,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:20:30,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:20:30,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:20:30" (1/1) ... [2021-01-06 23:20:30,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331a972e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:30, skipping insertion in model container [2021-01-06 23:20:30,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:20:30" (1/1) ... [2021-01-06 23:20:30,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:20:30,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:20:31,098 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/mix034_power.opt.i[950,963] 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_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_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_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~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[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~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_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EBX~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[~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_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~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] [2021-01-06 23:20:31,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:20:31,443 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:20:31,460 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/mix034_power.opt.i[950,963] 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_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_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_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd1~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[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~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_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EBX~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[~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_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z$r_buff1_thd2~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] [2021-01-06 23:20:31,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:20:31,657 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:20:31,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31 WrapperNode [2021-01-06 23:20:31,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:20:31,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:20:31,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:20:31,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:20:31,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:20:31,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:20:31,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:20:31,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:20:31,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... [2021-01-06 23:20:31,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:20:31,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:20:31,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:20:31,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:20:31,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:20:32,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:20:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:20:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:20:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:20:32,017 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:20:32,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:20:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:20:32,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:20:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:20:32,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:20:32,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:20:32,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:20:32,021 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:20:34,977 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:20:34,977 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:20:34,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:20:34 BoogieIcfgContainer [2021-01-06 23:20:34,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:20:34,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:20:34,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:20:34,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:20:34,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:20:30" (1/3) ... [2021-01-06 23:20:34,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6805bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:20:34, skipping insertion in model container [2021-01-06 23:20:34,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:20:31" (2/3) ... [2021-01-06 23:20:34,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6805bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:20:34, skipping insertion in model container [2021-01-06 23:20:34,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:20:34" (3/3) ... [2021-01-06 23:20:34,990 INFO L111 eAbstractionObserver]: Analyzing ICFG mix034_power.opt.i [2021-01-06 23:20:35,000 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:20:35,000 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:20:35,007 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:20:35,008 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:20:35,075 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,076 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,076 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,076 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,086 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,122 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,125 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:20:35,136 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:20:35,158 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 23:20:35,184 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:20:35,184 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:20:35,184 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:20:35,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:20:35,185 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:20:35,185 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:20:35,185 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:20:35,185 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:20:35,200 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:20:35,203 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 180 flow [2021-01-06 23:20:35,206 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 180 flow [2021-01-06 23:20:35,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-01-06 23:20:35,255 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-01-06 23:20:35,255 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:20:35,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-01-06 23:20:35,262 INFO L116 LiptonReduction]: Number of co-enabled transitions 1058 [2021-01-06 23:20:35,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:35,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:35,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:35,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:35,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:35,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:35,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:35,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:35,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:35,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-01-06 23:20:35,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,901 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:36,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:36,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:36,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:37,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-01-06 23:20:37,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:37,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:37,609 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:37,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:20:37,687 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:20:37,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:37,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:37,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:37,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:37,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:37,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:37,923 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:38,247 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-01-06 23:20:38,348 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:20:38,883 WARN L197 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-01-06 23:20:39,114 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:20:39,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,570 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:39,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:39,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:39,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:39,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:20:40,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:20:40,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,552 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:20:40,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:20:40,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,565 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:20:40,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,603 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:20:40,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:20:40,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:20:40,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:20:40,882 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-01-06 23:20:40,989 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-01-06 23:20:41,863 WARN L197 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-01-06 23:20:42,061 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-06 23:20:42,454 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-01-06 23:20:42,670 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-06 23:20:42,889 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-01-06 23:20:43,086 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-01-06 23:20:43,293 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-01-06 23:20:43,489 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-01-06 23:20:43,494 INFO L131 LiptonReduction]: Checked pairs total: 2777 [2021-01-06 23:20:43,494 INFO L133 LiptonReduction]: Total number of compositions: 76 [2021-01-06 23:20:43,505 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2021-01-06 23:20:43,526 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states. [2021-01-06 23:20:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2021-01-06 23:20:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-06 23:20:43,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:43,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-06 23:20:43,535 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash 930954, now seen corresponding path program 1 times [2021-01-06 23:20:43,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:43,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560430187] [2021-01-06 23:20:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:43,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560430187] [2021-01-06 23:20:43,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:43,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:20:43,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576748457] [2021-01-06 23:20:43,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:20:43,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:43,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:20:43,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:20:43,857 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2021-01-06 23:20:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:43,946 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2021-01-06 23:20:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:20:43,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-06 23:20:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:43,963 INFO L225 Difference]: With dead ends: 162 [2021-01-06 23:20:43,963 INFO L226 Difference]: Without dead ends: 132 [2021-01-06 23:20:43,964 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 [2021-01-06 23:20:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-06 23:20:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-01-06 23:20:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-06 23:20:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2021-01-06 23:20:44,016 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3 [2021-01-06 23:20:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:44,017 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2021-01-06 23:20:44,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:20:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2021-01-06 23:20:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-06 23:20:44,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:44,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:44,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:20:44,019 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 803533616, now seen corresponding path program 1 times [2021-01-06 23:20:44,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:44,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343822090] [2021-01-06 23:20:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:44,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343822090] [2021-01-06 23:20:44,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:44,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:20:44,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406003520] [2021-01-06 23:20:44,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:20:44,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:44,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:20:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:20:44,223 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2021-01-06 23:20:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:44,240 INFO L93 Difference]: Finished difference Result 128 states and 294 transitions. [2021-01-06 23:20:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:20:44,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-06 23:20:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:44,248 INFO L225 Difference]: With dead ends: 128 [2021-01-06 23:20:44,248 INFO L226 Difference]: Without dead ends: 128 [2021-01-06 23:20:44,249 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 [2021-01-06 23:20:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-01-06 23:20:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-01-06 23:20:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2021-01-06 23:20:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 294 transitions. [2021-01-06 23:20:44,278 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 294 transitions. Word has length 7 [2021-01-06 23:20:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:44,279 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 294 transitions. [2021-01-06 23:20:44,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:20:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 294 transitions. [2021-01-06 23:20:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:20:44,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:44,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:44,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:20:44,283 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash -187605573, now seen corresponding path program 1 times [2021-01-06 23:20:44,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:44,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031199004] [2021-01-06 23:20:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:44,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031199004] [2021-01-06 23:20:44,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:44,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:20:44,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557538941] [2021-01-06 23:20:44,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:20:44,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:44,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:20:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:20:44,423 INFO L87 Difference]: Start difference. First operand 128 states and 294 transitions. Second operand 4 states. [2021-01-06 23:20:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:44,470 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2021-01-06 23:20:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:20:44,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-06 23:20:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:44,474 INFO L225 Difference]: With dead ends: 122 [2021-01-06 23:20:44,475 INFO L226 Difference]: Without dead ends: 122 [2021-01-06 23:20:44,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:20:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-01-06 23:20:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-01-06 23:20:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-01-06 23:20:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2021-01-06 23:20:44,501 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 9 [2021-01-06 23:20:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:44,501 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2021-01-06 23:20:44,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:20:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2021-01-06 23:20:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:20:44,503 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:44,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:44,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:20:44,503 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:44,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:44,504 INFO L82 PathProgramCache]: Analyzing trace with hash -898325663, now seen corresponding path program 1 times [2021-01-06 23:20:44,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:44,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896362670] [2021-01-06 23:20:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:44,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896362670] [2021-01-06 23:20:44,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:44,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:20:44,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460956442] [2021-01-06 23:20:44,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:20:44,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:44,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:20:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:20:44,653 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 4 states. [2021-01-06 23:20:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:44,713 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2021-01-06 23:20:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:20:44,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-06 23:20:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:44,717 INFO L225 Difference]: With dead ends: 100 [2021-01-06 23:20:44,717 INFO L226 Difference]: Without dead ends: 70 [2021-01-06 23:20:44,717 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 [2021-01-06 23:20:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-01-06 23:20:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-01-06 23:20:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-01-06 23:20:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2021-01-06 23:20:44,731 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9 [2021-01-06 23:20:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:44,731 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2021-01-06 23:20:44,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:20:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2021-01-06 23:20:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:20:44,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:44,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:44,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:20:44,733 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:44,734 INFO L82 PathProgramCache]: Analyzing trace with hash 950685943, now seen corresponding path program 1 times [2021-01-06 23:20:44,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:44,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543699519] [2021-01-06 23:20:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:44,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543699519] [2021-01-06 23:20:44,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:44,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:20:44,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642629235] [2021-01-06 23:20:44,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:20:44,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:20:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:20:44,945 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states. [2021-01-06 23:20:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:45,018 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2021-01-06 23:20:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:20:45,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-01-06 23:20:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:45,020 INFO L225 Difference]: With dead ends: 55 [2021-01-06 23:20:45,020 INFO L226 Difference]: Without dead ends: 45 [2021-01-06 23:20:45,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:20:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-06 23:20:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-01-06 23:20:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2021-01-06 23:20:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2021-01-06 23:20:45,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2021-01-06 23:20:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:45,024 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2021-01-06 23:20:45,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:20:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2021-01-06 23:20:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:20:45,025 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:45,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:45,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:20:45,025 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:45,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1800383414, now seen corresponding path program 1 times [2021-01-06 23:20:45,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:45,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505025838] [2021-01-06 23:20:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:20:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:20:45,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505025838] [2021-01-06 23:20:45,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:20:45,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:20:45,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167683118] [2021-01-06 23:20:45,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:20:45,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:20:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:20:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:20:45,257 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 5 states. [2021-01-06 23:20:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:20:45,376 INFO L93 Difference]: Finished difference Result 66 states and 100 transitions. [2021-01-06 23:20:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:20:45,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-06 23:20:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:20:45,379 INFO L225 Difference]: With dead ends: 66 [2021-01-06 23:20:45,379 INFO L226 Difference]: Without dead ends: 48 [2021-01-06 23:20:45,379 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 [2021-01-06 23:20:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-01-06 23:20:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2021-01-06 23:20:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-06 23:20:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2021-01-06 23:20:45,389 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16 [2021-01-06 23:20:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:20:45,390 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2021-01-06 23:20:45,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:20:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2021-01-06 23:20:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:20:45,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:20:45,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:20:45,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:20:45,396 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:20:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:20:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1986785970, now seen corresponding path program 2 times [2021-01-06 23:20:45,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:20:45,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094191078] [2021-01-06 23:20:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:20:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:20:45,490 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:20:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:20:45,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:20:45,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:20:45,621 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:20:45,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:20:45,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:20:45 BasicIcfg [2021-01-06 23:20:45,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:20:45,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:20:45,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:20:45,729 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:20:45,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:20:34" (3/4) ... [2021-01-06 23:20:45,733 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:20:45,854 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix034_power.opt.i-witness.graphml [2021-01-06 23:20:45,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:20:45,856 INFO L168 Benchmark]: Toolchain (without parser) took 14997.51 ms. Allocated memory was 151.0 MB in the beginning and 291.5 MB in the end (delta: 140.5 MB). Free memory was 124.5 MB in the beginning and 144.4 MB in the end (delta: -19.9 MB). Peak memory consumption was 121.3 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,857 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:20:45,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.02 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 123.9 MB in the end (delta: 491.0 kB). Peak memory consumption was 29.7 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.72 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,861 INFO L168 Benchmark]: Boogie Preprocessor took 87.42 ms. Allocated memory is still 151.0 MB. Free memory was 121.2 MB in the beginning and 119.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,862 INFO L168 Benchmark]: RCFGBuilder took 3069.99 ms. Allocated memory was 151.0 MB in the beginning and 201.3 MB in the end (delta: 50.3 MB). Free memory was 119.1 MB in the beginning and 137.5 MB in the end (delta: -18.4 MB). Peak memory consumption was 76.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,862 INFO L168 Benchmark]: TraceAbstraction took 10744.10 ms. Allocated memory was 201.3 MB in the beginning and 291.5 MB in the end (delta: 90.2 MB). Free memory was 137.5 MB in the beginning and 156.0 MB in the end (delta: -18.5 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,866 INFO L168 Benchmark]: Witness Printer took 128.24 ms. Allocated memory is still 291.5 MB. Free memory was 156.0 MB in the beginning and 144.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-01-06 23:20:45,869 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.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.2 MB in the beginning and 123.1 MB in the end (delta: 96.0 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 798.02 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 123.9 MB in the end (delta: 491.0 kB). Peak memory consumption was 29.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 161.72 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 87.42 ms. Allocated memory is still 151.0 MB. Free memory was 121.2 MB in the beginning and 119.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3069.99 ms. Allocated memory was 151.0 MB in the beginning and 201.3 MB in the end (delta: 50.3 MB). Free memory was 119.1 MB in the beginning and 137.5 MB in the end (delta: -18.4 MB). Peak memory consumption was 76.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10744.10 ms. Allocated memory was 201.3 MB in the beginning and 291.5 MB in the end (delta: 90.2 MB). Free memory was 137.5 MB in the beginning and 156.0 MB in the end (delta: -18.5 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. * Witness Printer took 128.24 ms. Allocated memory is still 291.5 MB. Free memory was 156.0 MB in the beginning and 144.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 712 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.2s, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 20 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 76 TotalNumberOfCompositions, 2777 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L817] 0 pthread_t t899; [L818] FCALL, FORK 0 pthread_create(&t899, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L742] 1 z$w_buff1 = z$w_buff0 [L743] 1 z$w_buff0 = 1 [L744] 1 z$w_buff1_used = z$w_buff0_used [L745] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L747] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L748] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L749] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L819] 0 pthread_t t900; [L820] FCALL, FORK 0 pthread_create(&t900, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L770] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 z$flush_delayed = weak$$choice2 [L782] 2 z$mem_tmp = z [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L783] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L784] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L784] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L785] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L785] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L786] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L786] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L788] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L788] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L788] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L789] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = z [L791] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L791] 2 z = z$flush_delayed ? z$mem_tmp : z [L792] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L795] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L795] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L795] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L795] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L796] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L796] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L797] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L797] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L798] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L799] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L799] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L826] 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) [L826] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L826] 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) [L826] 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) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L827] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L828] 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 [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L829] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L830] 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 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 3 procedures, 84 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 113 SDtfs, 80 SDslu, 156 SDs, 0 SdLazy, 86 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 3493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...