/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/thin000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:39:50,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:39:50,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:39:50,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:39:50,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:39:50,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:39:50,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:39:50,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:39:50,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:39:50,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:39:50,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:39:50,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:39:50,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:39:50,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:39:50,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:39:50,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:39:50,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:39:50,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:39:50,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:39:50,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:39:50,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:39:50,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:39:50,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:39:50,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:39:50,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:39:50,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:39:50,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:39:50,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:39:50,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:39:50,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:39:50,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:39:50,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:39:50,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:39:50,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:39:50,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:39:50,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:39:50,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:39:50,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:39:50,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:39:50,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:39:50,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:39:50,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:39:50,530 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:39:50,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:39:50,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:39:50,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:39:50,532 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:39:50,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:39:50,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:39:50,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:39:50,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:39:50,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:39:50,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:39:50,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:39:50,534 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:39:50,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:39:50,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:39:50,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:39:50,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:39:50,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:39:50,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:39:50,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:39:50,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:39:50,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:39:50,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:39:50,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:39:50,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:39:50,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:39:50,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:39:50,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:39:50,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:39:50,998 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:39:50,998 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:39:50,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/thin000_rmo.oepc.i [2021-01-06 23:39:51,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa94b9eb0/c5a2bfa4d3d44cc3942b112e76149ff2/FLAGb7ef56f39 [2021-01-06 23:39:51,711 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:39:51,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin000_rmo.oepc.i [2021-01-06 23:39:51,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa94b9eb0/c5a2bfa4d3d44cc3942b112e76149ff2/FLAGb7ef56f39 [2021-01-06 23:39:51,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/aa94b9eb0/c5a2bfa4d3d44cc3942b112e76149ff2 [2021-01-06 23:39:51,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:39:51,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:39:51,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:39:51,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:39:52,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:39:52,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:39:51" (1/1) ... [2021-01-06 23:39:52,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6780dd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52, skipping insertion in model container [2021-01-06 23:39:52,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:39:51" (1/1) ... [2021-01-06 23:39:52,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:39:52,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:39:52,351 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/thin000_rmo.oepc.i[993,1006] 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[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:39:52,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:39:52,623 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:39:52,638 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/thin000_rmo.oepc.i[993,1006] 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[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:39:52,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:39:52,852 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:39:52,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52 WrapperNode [2021-01-06 23:39:52,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:39:52,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:39:52,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:39:52,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:39:52,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:39:52,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:39:52,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:39:52,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:39:52,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... [2021-01-06 23:39:52,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:39:52,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:39:52,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:39:52,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:39:52,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:39:53,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 23:39:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:39:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:39:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:39:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:39:53,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:39:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:39:53,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:39:53,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:39:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:39:53,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:39:53,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:39:53,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:39:53,083 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:39:55,220 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:39:55,220 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-01-06 23:39:55,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:55 BoogieIcfgContainer [2021-01-06 23:39:55,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:39:55,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:39:55,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:39:55,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:39:55,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:39:51" (1/3) ... [2021-01-06 23:39:55,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5686ab92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:39:55, skipping insertion in model container [2021-01-06 23:39:55,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:39:52" (2/3) ... [2021-01-06 23:39:55,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5686ab92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:39:55, skipping insertion in model container [2021-01-06 23:39:55,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:55" (3/3) ... [2021-01-06 23:39:55,231 INFO L111 eAbstractionObserver]: Analyzing ICFG thin000_rmo.oepc.i [2021-01-06 23:39:55,238 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:39:55,238 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:39:55,243 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 23:39:55,244 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:39:55,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,315 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,317 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,318 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:39:55,323 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:39:55,342 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-01-06 23:39:55,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:39:55,364 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:39:55,364 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:39:55,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:39:55,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:39:55,364 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:39:55,365 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:39:55,365 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:39:55,377 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:39:55,380 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 95 transitions, 200 flow [2021-01-06 23:39:55,383 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 95 transitions, 200 flow [2021-01-06 23:39:55,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2021-01-06 23:39:55,432 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-01-06 23:39:55,433 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:39:55,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2021-01-06 23:39:55,439 INFO L116 LiptonReduction]: Number of co-enabled transitions 782 [2021-01-06 23:39:55,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:55,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:55,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:55,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:55,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:55,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:55,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:39:55,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:55,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:39:55,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:55,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:39:55,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:39:56,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2021-01-06 23:39:56,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:39:56,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:39:56,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:39:56,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:56,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:56,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:39:56,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:39:56,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:39:56,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:39:56,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:56,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:39:56,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:39:58,169 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2021-01-06 23:39:58,682 WARN L197 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-01-06 23:40:00,979 WARN L197 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 322 DAG size of output: 278 [2021-01-06 23:40:02,051 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 275 [2021-01-06 23:40:02,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:02,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:02,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:02,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:02,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,609 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:02,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:02,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:02,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:02,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:02,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:02,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:02,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:02,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:02,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:02,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:03,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:03,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:03,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:03,324 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:03,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:03,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:03,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:03,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:04,040 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75 [2021-01-06 23:40:04,169 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-01-06 23:40:04,792 WARN L197 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2021-01-06 23:40:05,027 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-06 23:40:05,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:05,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:05,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:05,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:05,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:40:05,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:05,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:05,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:05,876 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:05,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:05,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:05,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:40:05,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:40:05,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:40:05,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:05,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:05,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:40:06,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:40:06,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:40:06,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:06,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:06,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:06,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:06,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:40:06,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:06,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:06,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:06,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:06,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:06,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:06,712 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-01-06 23:40:06,820 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:40:07,150 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-06 23:40:07,372 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 23:40:07,479 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 23:40:07,594 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 23:40:07,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:40:07,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:40:07,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,664 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,666 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,668 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:07,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:07,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:07,674 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:07,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:07,852 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-01-06 23:40:08,105 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-01-06 23:40:08,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:40:08,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:40:08,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,548 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 23:40:08,673 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 23:40:08,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:40:08,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:08,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:08,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:40:08,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,824 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,873 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,875 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:08,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,900 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,903 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,905 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,906 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,907 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:08,908 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:08,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,910 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:40:08,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:40:08,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:40:09,427 WARN L197 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-01-06 23:40:09,670 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-01-06 23:40:10,195 WARN L197 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-01-06 23:40:10,426 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-01-06 23:40:10,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-01-06 23:40:10,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:10,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:10,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:40:10,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:10,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:10,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term [2021-01-06 23:40:10,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:10,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:10,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-01-06 23:40:10,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:40:10,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:10,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2021-01-06 23:40:10,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:40:11,321 WARN L197 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 150 [2021-01-06 23:40:11,693 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:40:12,474 WARN L197 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 150 [2021-01-06 23:40:12,876 WARN L197 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2021-01-06 23:40:12,880 INFO L131 LiptonReduction]: Checked pairs total: 1773 [2021-01-06 23:40:12,880 INFO L133 LiptonReduction]: Total number of compositions: 86 [2021-01-06 23:40:12,890 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 17 transitions, 44 flow [2021-01-06 23:40:12,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110 states. [2021-01-06 23:40:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2021-01-06 23:40:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-01-06 23:40:12,912 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:12,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:12,913 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1859649584, now seen corresponding path program 1 times [2021-01-06 23:40:12,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:12,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236843084] [2021-01-06 23:40:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:13,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236843084] [2021-01-06 23:40:13,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:13,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:40:13,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470103195] [2021-01-06 23:40:13,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:40:13,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:13,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:40:13,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:40:13,375 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2021-01-06 23:40:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:13,416 INFO L93 Difference]: Finished difference Result 105 states and 237 transitions. [2021-01-06 23:40:13,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:40:13,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-01-06 23:40:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:13,429 INFO L225 Difference]: With dead ends: 105 [2021-01-06 23:40:13,429 INFO L226 Difference]: Without dead ends: 85 [2021-01-06 23:40:13,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:40:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-06 23:40:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-01-06 23:40:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-06 23:40:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 186 transitions. [2021-01-06 23:40:13,477 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 186 transitions. Word has length 7 [2021-01-06 23:40:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:13,478 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 186 transitions. [2021-01-06 23:40:13,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:40:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 186 transitions. [2021-01-06 23:40:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-06 23:40:13,479 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:13,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:13,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:40:13,480 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:13,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:13,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1815335521, now seen corresponding path program 1 times [2021-01-06 23:40:13,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:13,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088929886] [2021-01-06 23:40:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:13,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088929886] [2021-01-06 23:40:13,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:13,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:40:13,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170611308] [2021-01-06 23:40:13,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:40:13,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:40:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:40:13,631 INFO L87 Difference]: Start difference. First operand 85 states and 186 transitions. Second operand 3 states. [2021-01-06 23:40:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:13,647 INFO L93 Difference]: Finished difference Result 82 states and 178 transitions. [2021-01-06 23:40:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:40:13,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-06 23:40:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:13,652 INFO L225 Difference]: With dead ends: 82 [2021-01-06 23:40:13,652 INFO L226 Difference]: Without dead ends: 82 [2021-01-06 23:40:13,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:40:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-06 23:40:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-01-06 23:40:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-06 23:40:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 178 transitions. [2021-01-06 23:40:13,677 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 178 transitions. Word has length 8 [2021-01-06 23:40:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:13,677 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 178 transitions. [2021-01-06 23:40:13,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:40:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 178 transitions. [2021-01-06 23:40:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:40:13,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:13,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:13,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:40:13,679 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 440825002, now seen corresponding path program 1 times [2021-01-06 23:40:13,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:13,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831653667] [2021-01-06 23:40:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:13,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831653667] [2021-01-06 23:40:13,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:13,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:40:13,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142107131] [2021-01-06 23:40:13,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:40:13,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:13,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:40:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:40:13,805 INFO L87 Difference]: Start difference. First operand 82 states and 178 transitions. Second operand 4 states. [2021-01-06 23:40:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:13,833 INFO L93 Difference]: Finished difference Result 102 states and 213 transitions. [2021-01-06 23:40:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 23:40:13,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2021-01-06 23:40:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:13,835 INFO L225 Difference]: With dead ends: 102 [2021-01-06 23:40:13,835 INFO L226 Difference]: Without dead ends: 54 [2021-01-06 23:40:13,835 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 [2021-01-06 23:40:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-01-06 23:40:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-01-06 23:40:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-01-06 23:40:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 103 transitions. [2021-01-06 23:40:13,842 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 103 transitions. Word has length 9 [2021-01-06 23:40:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:13,842 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 103 transitions. [2021-01-06 23:40:13,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:40:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 103 transitions. [2021-01-06 23:40:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 23:40:13,843 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:13,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:13,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:40:13,844 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash 757583848, now seen corresponding path program 1 times [2021-01-06 23:40:13,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:13,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112225285] [2021-01-06 23:40:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:14,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112225285] [2021-01-06 23:40:14,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:14,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:40:14,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594156184] [2021-01-06 23:40:14,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:40:14,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:14,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:40:14,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:40:14,217 INFO L87 Difference]: Start difference. First operand 54 states and 103 transitions. Second operand 6 states. [2021-01-06 23:40:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:14,332 INFO L93 Difference]: Finished difference Result 52 states and 98 transitions. [2021-01-06 23:40:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 23:40:14,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2021-01-06 23:40:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:14,339 INFO L225 Difference]: With dead ends: 52 [2021-01-06 23:40:14,339 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 23:40:14,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:40:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 23:40:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-01-06 23:40:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-01-06 23:40:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 98 transitions. [2021-01-06 23:40:14,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 98 transitions. Word has length 10 [2021-01-06 23:40:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:14,354 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 98 transitions. [2021-01-06 23:40:14,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:40:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 98 transitions. [2021-01-06 23:40:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 23:40:14,355 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:14,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:14,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:40:14,355 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2010260918, now seen corresponding path program 1 times [2021-01-06 23:40:14,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:14,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864988061] [2021-01-06 23:40:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:14,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864988061] [2021-01-06 23:40:14,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:14,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:40:14,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403948219] [2021-01-06 23:40:14,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:40:14,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:40:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:40:14,448 INFO L87 Difference]: Start difference. First operand 52 states and 98 transitions. Second operand 4 states. [2021-01-06 23:40:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:14,476 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2021-01-06 23:40:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 23:40:14,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-01-06 23:40:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:14,478 INFO L225 Difference]: With dead ends: 50 [2021-01-06 23:40:14,478 INFO L226 Difference]: Without dead ends: 38 [2021-01-06 23:40:14,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:40:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-01-06 23:40:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-01-06 23:40:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-01-06 23:40:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2021-01-06 23:40:14,483 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 11 [2021-01-06 23:40:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:14,483 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 60 transitions. [2021-01-06 23:40:14,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:40:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions. [2021-01-06 23:40:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:40:14,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:14,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:14,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:40:14,484 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1104384328, now seen corresponding path program 1 times [2021-01-06 23:40:14,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:14,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580723240] [2021-01-06 23:40:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:40:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:40:14,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580723240] [2021-01-06 23:40:14,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:40:14,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:40:14,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979013712] [2021-01-06 23:40:14,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:40:14,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:40:14,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:40:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:40:14,592 INFO L87 Difference]: Start difference. First operand 38 states and 60 transitions. Second operand 5 states. [2021-01-06 23:40:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:40:14,635 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2021-01-06 23:40:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:40:14,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-01-06 23:40:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:40:14,636 INFO L225 Difference]: With dead ends: 31 [2021-01-06 23:40:14,636 INFO L226 Difference]: Without dead ends: 25 [2021-01-06 23:40:14,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:40:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-01-06 23:40:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-01-06 23:40:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 23:40:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-01-06 23:40:14,639 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2021-01-06 23:40:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:40:14,639 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-01-06 23:40:14,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:40:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-01-06 23:40:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 23:40:14,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:40:14,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:40:14,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:40:14,641 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:40:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:40:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1015099560, now seen corresponding path program 1 times [2021-01-06 23:40:14,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:40:14,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191095728] [2021-01-06 23:40:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:40:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:40:14,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:40:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:40:14,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:40:14,801 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:40:14,801 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:40:14,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:40:14,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:40:14 BasicIcfg [2021-01-06 23:40:14,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:40:14,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:40:14,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:40:14,910 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:40:14,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:39:55" (3/4) ... [2021-01-06 23:40:14,915 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:40:15,103 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/thin000_rmo.oepc.i-witness.graphml [2021-01-06 23:40:15,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:40:15,104 INFO L168 Benchmark]: Toolchain (without parser) took 23109.46 ms. Allocated memory was 151.0 MB in the beginning and 407.9 MB in the end (delta: 256.9 MB). Free memory was 123.7 MB in the beginning and 177.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 203.9 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,105 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:40:15,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.32 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 125.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.06 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 123.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,106 INFO L168 Benchmark]: Boogie Preprocessor took 43.64 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 121.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,106 INFO L168 Benchmark]: RCFGBuilder took 2265.97 ms. Allocated memory was 151.0 MB in the beginning and 188.7 MB in the end (delta: 37.7 MB). Free memory was 121.5 MB in the beginning and 137.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 91.9 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,107 INFO L168 Benchmark]: TraceAbstraction took 19684.65 ms. Allocated memory was 188.7 MB in the beginning and 407.9 MB in the end (delta: 219.2 MB). Free memory was 137.1 MB in the beginning and 189.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 166.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,110 INFO L168 Benchmark]: Witness Printer took 193.75 ms. Allocated memory is still 407.9 MB. Free memory was 189.4 MB in the beginning and 177.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-01-06 23:40:15,115 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.18 ms. Allocated memory is still 151.0 MB. Free memory is still 125.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 855.32 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 125.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 57.06 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 123.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.64 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 121.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2265.97 ms. Allocated memory was 151.0 MB in the beginning and 188.7 MB in the end (delta: 37.7 MB). Free memory was 121.5 MB in the beginning and 137.6 MB in the end (delta: -16.1 MB). Peak memory consumption was 91.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 19684.65 ms. Allocated memory was 188.7 MB in the beginning and 407.9 MB in the end (delta: 219.2 MB). Free memory was 137.1 MB in the beginning and 189.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 166.8 MB. Max. memory is 8.0 GB. * Witness Printer took 193.75 ms. Allocated memory is still 407.9 MB. Free memory was 189.4 MB in the beginning and 177.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 490 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 53 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.4s, 100 PlacesBefore, 24 PlacesAfterwards, 95 TransitionsBefore, 17 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 1773 MoverChecksTotal - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t2673; [L813] FCALL, FORK 0 pthread_create(&t2673, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t2674; [L815] FCALL, FORK 0 pthread_create(&t2674, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x=0, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L784] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=0, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={5:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice1=255, weak$$choice2=255, x=1, y={5:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.4s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.5s, HoareTripleCheckerStatistics: 75 SDtfs, 82 SDslu, 75 SDs, 0 SdLazy, 56 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 3075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...