/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/mix028_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:25:57,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:25:57,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:25:57,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:25:57,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:25:57,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:25:57,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:25:57,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:25:57,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:25:57,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:25:57,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:25:57,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:25:57,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:25:57,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:25:57,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:25:57,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:25:57,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:25:57,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:25:57,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:25:57,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:25:57,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:25:57,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:25:57,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:25:57,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:25:57,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:25:57,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:25:57,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:25:57,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:25:57,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:25:57,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:25:57,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:25:57,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:25:57,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:25:57,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:25:57,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:25:57,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:25:57,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:25:57,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:25:57,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:25:57,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:25:57,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:25:57,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:25:57,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:25:57,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:25:57,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:25:57,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:25:57,974 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:25:57,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:25:57,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:25:57,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:25:57,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:25:57,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:25:57,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:25:57,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:25:57,977 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:25:57,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:25:57,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:25:57,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:25:57,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:25:57,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:25:57,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:25:57,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:25:57,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:25:57,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:25:57,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:25:57,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:25:57,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:25:57,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 13:25:58,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:25:58,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:25:58,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:25:58,478 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:25:58,478 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:25:58,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_pso.opt.i [2020-12-23 13:25:58,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e6eadef/e8a417e2deae41e783ff2ad65388499a/FLAG7cd348345 [2020-12-23 13:25:59,387 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:25:59,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_pso.opt.i [2020-12-23 13:25:59,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e6eadef/e8a417e2deae41e783ff2ad65388499a/FLAG7cd348345 [2020-12-23 13:25:59,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e6eadef/e8a417e2deae41e783ff2ad65388499a [2020-12-23 13:25:59,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:25:59,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:25:59,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:25:59,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:25:59,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:25:59,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:25:59" (1/1) ... [2020-12-23 13:25:59,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6558efeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:25:59, skipping insertion in model container [2020-12-23 13:25:59,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:25:59" (1/1) ... [2020-12-23 13:25:59,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:25:59,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:26:00,014 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/mix028_pso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~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[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2020-12-23 13:26:00,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:26:00,322 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:26:00,335 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/mix028_pso.opt.i[948,961] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~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[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2020-12-23 13:26:00,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:26:00,492 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:26:00,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00 WrapperNode [2020-12-23 13:26:00,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:26:00,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:26:00,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:26:00,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:26:00,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:26:00,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:26:00,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:26:00,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:26:00,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... [2020-12-23 13:26:00,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:26:00,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:26:00,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:26:00,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:26:00,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:26:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:26:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:26:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:26:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:26:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:26:00,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:26:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:26:00,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:26:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-23 13:26:00,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-23 13:26:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:26:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:26:00,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:26:00,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:26:00,748 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:26:03,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:26:03,606 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 13:26:03,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:26:03 BoogieIcfgContainer [2020-12-23 13:26:03,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:26:03,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:26:03,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:26:03,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:26:03,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:25:59" (1/3) ... [2020-12-23 13:26:03,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dcc9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:26:03, skipping insertion in model container [2020-12-23 13:26:03,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:26:00" (2/3) ... [2020-12-23 13:26:03,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dcc9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:26:03, skipping insertion in model container [2020-12-23 13:26:03,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:26:03" (3/3) ... [2020-12-23 13:26:03,618 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_pso.opt.i [2020-12-23 13:26:03,626 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:26:03,627 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:26:03,632 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 13:26:03,634 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:26:03,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,681 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,681 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,682 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,682 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,692 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,694 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,701 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,701 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,712 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,712 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,732 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:26:03,737 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:26:03,758 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 13:26:03,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:26:03,796 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:26:03,796 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:26:03,796 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:26:03,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:26:03,796 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:26:03,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:26:03,797 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:26:03,814 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:26:03,816 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-23 13:26:03,819 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-23 13:26:03,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-12-23 13:26:03,874 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-12-23 13:26:03,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:26:03,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-12-23 13:26:03,883 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-12-23 13:26:04,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:26:04,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:04,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:26:04,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:04,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:04,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:04,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,246 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:04,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:04,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:04,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:04,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:04,270 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:04,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:04,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:04,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:04,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:04,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:04,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:04,375 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:04,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-23 13:26:04,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:04,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-23 13:26:04,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:04,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:04,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:04,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:04,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:05,872 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-23 13:26:06,354 WARN L197 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-23 13:26:08,601 WARN L197 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-23 13:26:09,613 WARN L197 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 265 [2020-12-23 13:26:09,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:26:09,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:26:09,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:09,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:09,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:09,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:09,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:09,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:09,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:09,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:10,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:10,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:10,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:10,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:10,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:10,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:10,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:10,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:10,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:10,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:10,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:10,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:10,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:10,530 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-23 13:26:10,640 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 13:26:11,193 WARN L197 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-23 13:26:11,446 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-23 13:26:11,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:11,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:11,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:11,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:11,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:11,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:11,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:11,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:11,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:11,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:11,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:11,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:11,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:11,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:11,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:11,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:26:11,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-23 13:26:11,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:26:11,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,816 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:11,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:11,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:11,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:11,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:11,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:26:11,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:11,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:26:11,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:12,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:12,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:12,073 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-23 13:26:12,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:12,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:12,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:12,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:12,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:12,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:12,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:12,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:12,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:12,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:12,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:12,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:12,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:12,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:12,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:12,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:12,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:12,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:12,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:13,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,062 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:13,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:13,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-23 13:26:13,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:26:13,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:13,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:13,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-23 13:26:13,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:13,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:26:13,159 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-23 13:26:13,159 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:26:13,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:26:13,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:13,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:13,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:13,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-23 13:26:13,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:14,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:14,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:14,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:14,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:14,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:14,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:14,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:14,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:14,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:14,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:14,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:14,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:14,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:14,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:14,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:14,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:14,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:14,601 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:26:14,727 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:26:15,008 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-23 13:26:15,276 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-23 13:26:15,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:15,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:15,325 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:15,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:15,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-23 13:26:15,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:15,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-23 13:26:15,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:26:15,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:15,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:15,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:15,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:15,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:15,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:26:15,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:15,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:26:15,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:26:15,616 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-23 13:26:15,787 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-23 13:26:17,201 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-23 13:26:17,351 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-23 13:26:17,500 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-23 13:26:17,668 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-23 13:26:18,167 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-23 13:26:18,397 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-23 13:26:18,909 WARN L197 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-23 13:26:19,170 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-23 13:26:19,179 INFO L131 LiptonReduction]: Checked pairs total: 5519 [2020-12-23 13:26:19,180 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-23 13:26:19,196 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-23 13:26:19,300 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1152 states. [2020-12-23 13:26:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states. [2020-12-23 13:26:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-23 13:26:19,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:19,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-23 13:26:19,310 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1021400768, now seen corresponding path program 1 times [2020-12-23 13:26:19,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:19,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703945847] [2020-12-23 13:26:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:19,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703945847] [2020-12-23 13:26:19,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:19,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:26:19,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486990541] [2020-12-23 13:26:19,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:26:19,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:26:19,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:26:19,780 INFO L87 Difference]: Start difference. First operand 1152 states. Second operand 3 states. [2020-12-23 13:26:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:19,923 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-12-23 13:26:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:26:19,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-23 13:26:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:19,966 INFO L225 Difference]: With dead ends: 962 [2020-12-23 13:26:19,966 INFO L226 Difference]: Without dead ends: 812 [2020-12-23 13:26:19,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:26:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-23 13:26:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-12-23 13:26:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-12-23 13:26:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-12-23 13:26:20,108 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2020-12-23 13:26:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:20,108 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-12-23 13:26:20,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:26:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-12-23 13:26:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 13:26:20,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:20,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:20,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:26:20,113 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:20,117 INFO L82 PathProgramCache]: Analyzing trace with hash 95194119, now seen corresponding path program 1 times [2020-12-23 13:26:20,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:20,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441468505] [2020-12-23 13:26:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:20,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441468505] [2020-12-23 13:26:20,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:20,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:26:20,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073721735] [2020-12-23 13:26:20,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:26:20,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:20,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:26:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:26:20,342 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-12-23 13:26:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:20,401 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2020-12-23 13:26:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:26:20,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-23 13:26:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:20,408 INFO L225 Difference]: With dead ends: 862 [2020-12-23 13:26:20,409 INFO L226 Difference]: Without dead ends: 712 [2020-12-23 13:26:20,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-12-23 13:26:20,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-12-23 13:26:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-12-23 13:26:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-12-23 13:26:20,435 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2020-12-23 13:26:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:20,436 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-12-23 13:26:20,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:26:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-12-23 13:26:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:26:20,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:20,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:20,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:26:20,444 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1249705605, now seen corresponding path program 1 times [2020-12-23 13:26:20,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:20,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4072061] [2020-12-23 13:26:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:20,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4072061] [2020-12-23 13:26:20,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:20,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:26:20,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039782611] [2020-12-23 13:26:20,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:26:20,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:26:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:20,777 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 5 states. [2020-12-23 13:26:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:20,966 INFO L93 Difference]: Finished difference Result 796 states and 2398 transitions. [2020-12-23 13:26:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:26:20,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-23 13:26:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:20,974 INFO L225 Difference]: With dead ends: 796 [2020-12-23 13:26:20,974 INFO L226 Difference]: Without dead ends: 696 [2020-12-23 13:26:20,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-12-23 13:26:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2020-12-23 13:26:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-12-23 13:26:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2155 transitions. [2020-12-23 13:26:21,001 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2155 transitions. Word has length 12 [2020-12-23 13:26:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:21,002 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 2155 transitions. [2020-12-23 13:26:21,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:26:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2155 transitions. [2020-12-23 13:26:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:26:21,004 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:21,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:21,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:26:21,005 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2108317782, now seen corresponding path program 1 times [2020-12-23 13:26:21,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:21,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318659795] [2020-12-23 13:26:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:21,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318659795] [2020-12-23 13:26:21,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:21,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:26:21,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492970284] [2020-12-23 13:26:21,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:26:21,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:21,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:26:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:21,113 INFO L87 Difference]: Start difference. First operand 696 states and 2155 transitions. Second operand 5 states. [2020-12-23 13:26:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:21,222 INFO L93 Difference]: Finished difference Result 760 states and 2283 transitions. [2020-12-23 13:26:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:26:21,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 13:26:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:21,229 INFO L225 Difference]: With dead ends: 760 [2020-12-23 13:26:21,230 INFO L226 Difference]: Without dead ends: 680 [2020-12-23 13:26:21,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-12-23 13:26:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2020-12-23 13:26:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-12-23 13:26:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 2091 transitions. [2020-12-23 13:26:21,256 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 2091 transitions. Word has length 13 [2020-12-23 13:26:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:21,256 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 2091 transitions. [2020-12-23 13:26:21,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:26:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 2091 transitions. [2020-12-23 13:26:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 13:26:21,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:21,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:21,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:26:21,259 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash 507810598, now seen corresponding path program 1 times [2020-12-23 13:26:21,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:21,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516368050] [2020-12-23 13:26:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:21,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516368050] [2020-12-23 13:26:21,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:21,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:26:21,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258380023] [2020-12-23 13:26:21,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:26:21,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:26:21,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:21,436 INFO L87 Difference]: Start difference. First operand 680 states and 2091 transitions. Second operand 6 states. [2020-12-23 13:26:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:21,686 INFO L93 Difference]: Finished difference Result 744 states and 2236 transitions. [2020-12-23 13:26:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:26:21,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-23 13:26:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:21,694 INFO L225 Difference]: With dead ends: 744 [2020-12-23 13:26:21,695 INFO L226 Difference]: Without dead ends: 682 [2020-12-23 13:26:21,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:26:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-12-23 13:26:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2020-12-23 13:26:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2020-12-23 13:26:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2094 transitions. [2020-12-23 13:26:21,727 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2094 transitions. Word has length 14 [2020-12-23 13:26:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:21,728 INFO L481 AbstractCegarLoop]: Abstraction has 682 states and 2094 transitions. [2020-12-23 13:26:21,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:26:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2094 transitions. [2020-12-23 13:26:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:26:21,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:21,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:21,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:26:21,731 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 161092341, now seen corresponding path program 1 times [2020-12-23 13:26:21,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:21,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727288148] [2020-12-23 13:26:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:22,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727288148] [2020-12-23 13:26:22,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:22,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:26:22,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245569851] [2020-12-23 13:26:22,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:26:22,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:26:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:26:22,017 INFO L87 Difference]: Start difference. First operand 682 states and 2094 transitions. Second operand 7 states. [2020-12-23 13:26:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:22,285 INFO L93 Difference]: Finished difference Result 730 states and 2196 transitions. [2020-12-23 13:26:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 13:26:22,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-23 13:26:22,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:22,293 INFO L225 Difference]: With dead ends: 730 [2020-12-23 13:26:22,294 INFO L226 Difference]: Without dead ends: 686 [2020-12-23 13:26:22,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-23 13:26:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-12-23 13:26:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-12-23 13:26:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-12-23 13:26:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 2098 transitions. [2020-12-23 13:26:22,322 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 2098 transitions. Word has length 15 [2020-12-23 13:26:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:22,323 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 2098 transitions. [2020-12-23 13:26:22,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:26:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 2098 transitions. [2020-12-23 13:26:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:26:22,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:22,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:22,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:26:22,327 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 662740777, now seen corresponding path program 1 times [2020-12-23 13:26:22,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:22,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954460518] [2020-12-23 13:26:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:22,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954460518] [2020-12-23 13:26:22,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:22,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:26:22,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409457253] [2020-12-23 13:26:22,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:26:22,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:26:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:22,480 INFO L87 Difference]: Start difference. First operand 686 states and 2098 transitions. Second operand 6 states. [2020-12-23 13:26:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:22,713 INFO L93 Difference]: Finished difference Result 868 states and 2639 transitions. [2020-12-23 13:26:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:26:22,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-23 13:26:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:22,721 INFO L225 Difference]: With dead ends: 868 [2020-12-23 13:26:22,722 INFO L226 Difference]: Without dead ends: 816 [2020-12-23 13:26:22,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 13:26:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2020-12-23 13:26:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 732. [2020-12-23 13:26:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-12-23 13:26:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2253 transitions. [2020-12-23 13:26:22,750 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2253 transitions. Word has length 15 [2020-12-23 13:26:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:22,750 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 2253 transitions. [2020-12-23 13:26:22,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:26:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2253 transitions. [2020-12-23 13:26:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:26:22,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:22,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:22,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:26:22,753 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1437724627, now seen corresponding path program 2 times [2020-12-23 13:26:22,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:22,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613812102] [2020-12-23 13:26:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:22,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613812102] [2020-12-23 13:26:22,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:22,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:26:22,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208226976] [2020-12-23 13:26:22,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:26:22,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:26:22,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:26:22,914 INFO L87 Difference]: Start difference. First operand 732 states and 2253 transitions. Second operand 7 states. [2020-12-23 13:26:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:23,131 INFO L93 Difference]: Finished difference Result 796 states and 2409 transitions. [2020-12-23 13:26:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:26:23,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-23 13:26:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:23,138 INFO L225 Difference]: With dead ends: 796 [2020-12-23 13:26:23,138 INFO L226 Difference]: Without dead ends: 744 [2020-12-23 13:26:23,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:26:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2020-12-23 13:26:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 726. [2020-12-23 13:26:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-12-23 13:26:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2236 transitions. [2020-12-23 13:26:23,165 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2236 transitions. Word has length 15 [2020-12-23 13:26:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:23,165 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2236 transitions. [2020-12-23 13:26:23,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:26:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2236 transitions. [2020-12-23 13:26:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:26:23,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:23,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:23,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:26:23,168 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash 143265631, now seen corresponding path program 3 times [2020-12-23 13:26:23,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:23,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150650645] [2020-12-23 13:26:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:23,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150650645] [2020-12-23 13:26:23,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:23,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:26:23,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952842270] [2020-12-23 13:26:23,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:26:23,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:23,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:26:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:23,258 INFO L87 Difference]: Start difference. First operand 726 states and 2236 transitions. Second operand 6 states. [2020-12-23 13:26:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:23,392 INFO L93 Difference]: Finished difference Result 854 states and 2576 transitions. [2020-12-23 13:26:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:26:23,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-23 13:26:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:23,399 INFO L225 Difference]: With dead ends: 854 [2020-12-23 13:26:23,400 INFO L226 Difference]: Without dead ends: 794 [2020-12-23 13:26:23,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:26:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-12-23 13:26:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 730. [2020-12-23 13:26:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2020-12-23 13:26:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2222 transitions. [2020-12-23 13:26:23,452 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 2222 transitions. Word has length 15 [2020-12-23 13:26:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:23,452 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 2222 transitions. [2020-12-23 13:26:23,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:26:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 2222 transitions. [2020-12-23 13:26:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:26:23,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:23,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:23,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:26:23,455 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 2098862187, now seen corresponding path program 1 times [2020-12-23 13:26:23,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:23,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114244055] [2020-12-23 13:26:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:23,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114244055] [2020-12-23 13:26:23,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:23,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:26:23,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544169841] [2020-12-23 13:26:23,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:26:23,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:23,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:26:23,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:26:23,551 INFO L87 Difference]: Start difference. First operand 730 states and 2222 transitions. Second operand 4 states. [2020-12-23 13:26:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:23,592 INFO L93 Difference]: Finished difference Result 672 states and 1807 transitions. [2020-12-23 13:26:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:26:23,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 13:26:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:23,597 INFO L225 Difference]: With dead ends: 672 [2020-12-23 13:26:23,597 INFO L226 Difference]: Without dead ends: 500 [2020-12-23 13:26:23,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-12-23 13:26:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-12-23 13:26:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-12-23 13:26:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1302 transitions. [2020-12-23 13:26:23,619 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1302 transitions. Word has length 15 [2020-12-23 13:26:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:23,622 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1302 transitions. [2020-12-23 13:26:23,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:26:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1302 transitions. [2020-12-23 13:26:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 13:26:23,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:23,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:23,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:26:23,624 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -408767852, now seen corresponding path program 1 times [2020-12-23 13:26:23,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:23,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648648978] [2020-12-23 13:26:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:23,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648648978] [2020-12-23 13:26:23,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:23,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:26:23,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562920574] [2020-12-23 13:26:23,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:26:23,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:26:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:23,745 INFO L87 Difference]: Start difference. First operand 500 states and 1302 transitions. Second operand 5 states. [2020-12-23 13:26:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:23,798 INFO L93 Difference]: Finished difference Result 377 states and 900 transitions. [2020-12-23 13:26:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:26:23,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 13:26:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:23,801 INFO L225 Difference]: With dead ends: 377 [2020-12-23 13:26:23,802 INFO L226 Difference]: Without dead ends: 294 [2020-12-23 13:26:23,802 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 [2020-12-23 13:26:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-23 13:26:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 278. [2020-12-23 13:26:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-12-23 13:26:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 644 transitions. [2020-12-23 13:26:23,812 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 644 transitions. Word has length 16 [2020-12-23 13:26:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:23,812 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 644 transitions. [2020-12-23 13:26:23,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:26:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 644 transitions. [2020-12-23 13:26:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 13:26:23,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:23,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:23,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:26:23,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1132272182, now seen corresponding path program 1 times [2020-12-23 13:26:23,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:23,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311807661] [2020-12-23 13:26:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:23,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311807661] [2020-12-23 13:26:23,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:23,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:26:23,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445776497] [2020-12-23 13:26:23,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:26:23,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:26:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:26:23,899 INFO L87 Difference]: Start difference. First operand 278 states and 644 transitions. Second operand 5 states. [2020-12-23 13:26:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:23,943 INFO L93 Difference]: Finished difference Result 388 states and 870 transitions. [2020-12-23 13:26:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:26:23,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-23 13:26:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:23,946 INFO L225 Difference]: With dead ends: 388 [2020-12-23 13:26:23,946 INFO L226 Difference]: Without dead ends: 284 [2020-12-23 13:26:23,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:26:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-23 13:26:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2020-12-23 13:26:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2020-12-23 13:26:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 622 transitions. [2020-12-23 13:26:23,955 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 622 transitions. Word has length 19 [2020-12-23 13:26:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:23,956 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 622 transitions. [2020-12-23 13:26:23,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:26:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 622 transitions. [2020-12-23 13:26:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 13:26:23,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:23,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:23,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:26:23,957 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash 236318483, now seen corresponding path program 1 times [2020-12-23 13:26:23,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:23,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722308203] [2020-12-23 13:26:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:24,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722308203] [2020-12-23 13:26:24,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:24,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:26:24,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384161978] [2020-12-23 13:26:24,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:26:24,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:26:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:26:24,052 INFO L87 Difference]: Start difference. First operand 278 states and 622 transitions. Second operand 6 states. [2020-12-23 13:26:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:24,102 INFO L93 Difference]: Finished difference Result 242 states and 549 transitions. [2020-12-23 13:26:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:26:24,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-23 13:26:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:24,104 INFO L225 Difference]: With dead ends: 242 [2020-12-23 13:26:24,104 INFO L226 Difference]: Without dead ends: 118 [2020-12-23 13:26:24,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:26:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-23 13:26:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2020-12-23 13:26:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-23 13:26:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 223 transitions. [2020-12-23 13:26:24,108 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 223 transitions. Word has length 19 [2020-12-23 13:26:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:24,109 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 223 transitions. [2020-12-23 13:26:24,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:26:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 223 transitions. [2020-12-23 13:26:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:26:24,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:24,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:24,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:26:24,110 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 153825375, now seen corresponding path program 1 times [2020-12-23 13:26:24,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:24,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728416231] [2020-12-23 13:26:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:26:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:26:24,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728416231] [2020-12-23 13:26:24,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:26:24,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 13:26:24,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920287326] [2020-12-23 13:26:24,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 13:26:24,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:26:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 13:26:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-23 13:26:24,389 INFO L87 Difference]: Start difference. First operand 108 states and 223 transitions. Second operand 10 states. [2020-12-23 13:26:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:26:24,593 INFO L93 Difference]: Finished difference Result 129 states and 259 transitions. [2020-12-23 13:26:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:26:24,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-23 13:26:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:26:24,595 INFO L225 Difference]: With dead ends: 129 [2020-12-23 13:26:24,595 INFO L226 Difference]: Without dead ends: 86 [2020-12-23 13:26:24,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-12-23 13:26:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-23 13:26:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-12-23 13:26:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-23 13:26:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 171 transitions. [2020-12-23 13:26:24,599 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 171 transitions. Word has length 23 [2020-12-23 13:26:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:26:24,599 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 171 transitions. [2020-12-23 13:26:24,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 13:26:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 171 transitions. [2020-12-23 13:26:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 13:26:24,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:26:24,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:26:24,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 13:26:24,600 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:26:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:26:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1530465991, now seen corresponding path program 2 times [2020-12-23 13:26:24,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:26:24,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412683733] [2020-12-23 13:26:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:26:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:26:24,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:26:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:26:24,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:26:24,770 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:26:24,770 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:26:24,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 13:26:24,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:26:24 BasicIcfg [2020-12-23 13:26:24,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:26:24,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:26:24,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:26:24,923 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:26:24,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:26:03" (3/4) ... [2020-12-23 13:26:24,928 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:26:25,061 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix028_pso.opt.i-witness.graphml [2020-12-23 13:26:25,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:26:25,063 INFO L168 Benchmark]: Toolchain (without parser) took 25431.28 ms. Allocated memory was 151.0 MB in the beginning and 385.9 MB in the end (delta: 234.9 MB). Free memory was 124.8 MB in the beginning and 337.2 MB in the end (delta: -212.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,063 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:26:25,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.56 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 90.2 MB in the end (delta: 34.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.08 ms. Allocated memory is still 151.0 MB. Free memory was 90.2 MB in the beginning and 87.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,065 INFO L168 Benchmark]: Boogie Preprocessor took 58.05 ms. Allocated memory is still 151.0 MB. Free memory was 87.2 MB in the beginning and 85.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,065 INFO L168 Benchmark]: RCFGBuilder took 2980.32 ms. Allocated memory was 151.0 MB in the beginning and 184.5 MB in the end (delta: 33.6 MB). Free memory was 85.1 MB in the beginning and 118.2 MB in the end (delta: -33.1 MB). Peak memory consumption was 43.9 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,066 INFO L168 Benchmark]: TraceAbstraction took 21311.60 ms. Allocated memory was 184.5 MB in the beginning and 385.9 MB in the end (delta: 201.3 MB). Free memory was 117.6 MB in the beginning and 351.3 MB in the end (delta: -233.7 MB). Peak memory consumption was 187.8 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,066 INFO L168 Benchmark]: Witness Printer took 139.13 ms. Allocated memory is still 385.9 MB. Free memory was 350.8 MB in the beginning and 337.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 13:26:25,069 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 124.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 858.56 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 90.2 MB in the end (delta: 34.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 74.08 ms. Allocated memory is still 151.0 MB. Free memory was 90.2 MB in the beginning and 87.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.05 ms. Allocated memory is still 151.0 MB. Free memory was 87.2 MB in the beginning and 85.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2980.32 ms. Allocated memory was 151.0 MB in the beginning and 184.5 MB in the end (delta: 33.6 MB). Free memory was 85.1 MB in the beginning and 118.2 MB in the end (delta: -33.1 MB). Peak memory consumption was 43.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21311.60 ms. Allocated memory was 184.5 MB in the beginning and 385.9 MB in the end (delta: 201.3 MB). Free memory was 117.6 MB in the beginning and 351.3 MB in the end (delta: -233.7 MB). Peak memory consumption was 187.8 MB. Max. memory is 8.0 GB. * Witness Printer took 139.13 ms. Allocated memory is still 385.9 MB. Free memory was 350.8 MB in the beginning and 337.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1253 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 160 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.3s, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 5519 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t754; [L824] FCALL, FORK 0 pthread_create(&t754, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t755; [L826] FCALL, FORK 0 pthread_create(&t755, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 0 pthread_t t756; [L828] FCALL, FORK 0 pthread_create(&t756, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 470 SDtfs, 506 SDslu, 1029 SDs, 0 SdLazy, 523 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 198 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 31170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...