/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:15:35,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:15:35,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:15:35,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:15:35,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:15:35,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:15:35,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:15:35,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:15:35,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:15:35,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:15:35,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:15:35,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:15:35,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:15:35,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:15:35,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:15:35,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:15:35,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:15:35,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:15:35,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:15:35,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:15:35,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:15:35,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:15:35,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:15:35,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:15:35,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:15:35,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:15:35,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:15:35,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:15:35,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:15:35,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:15:35,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:15:35,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:15:35,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:15:35,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:15:35,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:15:35,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:15:35,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:15:35,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:15:35,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:15:35,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:15:35,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:15:35,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:15:35,522 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:15:35,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:15:35,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:15:35,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:15:35,530 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:15:35,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:15:35,530 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:15:35,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:15:35,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:15:35,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:15:35,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:15:35,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:15:35,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:15:35,534 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:15:35,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:15:35,535 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:15:35,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:15:35,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:15:35,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:15:35,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:15:35,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:15:35,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:15:35,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:15:35,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:15:35,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:15:35,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:15:35,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:15:35,539 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:15:35,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:15:35,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:15:35,539 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:15:36,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:15:36,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:15:36,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:15:36,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:15:36,070 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:15:36,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2020-11-09 15:15:36,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79941d14d/450c231ef7b64a2893fc821451569dd5/FLAG31dc75c88 [2020-11-09 15:15:37,127 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:15:37,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_pso.oepc.i [2020-11-09 15:15:37,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79941d14d/450c231ef7b64a2893fc821451569dd5/FLAG31dc75c88 [2020-11-09 15:15:37,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79941d14d/450c231ef7b64a2893fc821451569dd5 [2020-11-09 15:15:37,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:15:37,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:15:37,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:15:37,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:15:37,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:15:37,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:15:37" (1/1) ... [2020-11-09 15:15:37,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0a5353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:37, skipping insertion in model container [2020-11-09 15:15:37,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:15:37" (1/1) ... [2020-11-09 15:15:37,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:15:37,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:15:38,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:15:38,043 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:15:38,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:15:38,311 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:15:38,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38 WrapperNode [2020-11-09 15:15:38,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:15:38,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:15:38,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:15:38,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:15:38,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:15:38,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:15:38,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:15:38,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:15:38,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... [2020-11-09 15:15:38,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:15:38,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:15:38,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:15:38,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:15:38,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:15:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:15:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:15:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:15:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:15:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:15:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:15:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:15:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:15:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:15:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:15:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:15:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:15:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:15:38,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:15:38,574 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:15:41,860 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:15:41,861 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:15:41,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:15:41 BoogieIcfgContainer [2020-11-09 15:15:41,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:15:41,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:15:41,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:15:41,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:15:41,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:15:37" (1/3) ... [2020-11-09 15:15:41,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dca7ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:15:41, skipping insertion in model container [2020-11-09 15:15:41,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:15:38" (2/3) ... [2020-11-09 15:15:41,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dca7ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:15:41, skipping insertion in model container [2020-11-09 15:15:41,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:15:41" (3/3) ... [2020-11-09 15:15:41,877 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_pso.oepc.i [2020-11-09 15:15:41,898 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:15:41,898 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:15:41,904 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:15:41,905 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:15:41,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,959 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,959 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,960 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,960 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,961 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,961 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,961 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,962 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,965 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,972 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,972 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,972 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,972 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,973 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,973 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,976 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,979 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,979 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:41,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:15:42,084 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:15:42,100 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:15:42,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:15:42,132 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:15:42,133 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:15:42,133 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:15:42,133 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:15:42,133 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:15:42,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:15:42,133 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:15:42,153 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:15:42,154 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 15:15:42,159 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 15:15:42,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-11-09 15:15:42,227 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-11-09 15:15:42,228 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:15:42,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-09 15:15:42,239 INFO L116 LiptonReduction]: Number of co-enabled transitions 1962 [2020-11-09 15:15:43,023 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 15:15:43,186 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 15:15:43,333 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 15:15:45,292 WARN L194 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:15:45,496 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:15:46,308 WARN L194 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2020-11-09 15:15:46,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:15:46,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:15:46,991 WARN L194 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2020-11-09 15:15:48,764 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-11-09 15:15:48,901 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-11-09 15:15:49,742 WARN L194 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-09 15:15:49,850 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 15:15:50,089 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-09 15:15:50,201 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 15:15:50,315 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-11-09 15:15:51,371 WARN L194 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-09 15:15:51,653 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 15:15:52,238 WARN L194 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-09 15:15:52,494 WARN L194 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 15:15:52,520 INFO L131 LiptonReduction]: Checked pairs total: 6047 [2020-11-09 15:15:52,520 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-11-09 15:15:52,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-09 15:15:52,652 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-11-09 15:15:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-11-09 15:15:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 15:15:52,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:52,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 15:15:52,667 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1099180, now seen corresponding path program 1 times [2020-11-09 15:15:52,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:52,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365491739] [2020-11-09 15:15:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:53,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365491739] [2020-11-09 15:15:53,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:53,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:15:53,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468653330] [2020-11-09 15:15:53,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:53,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:53,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 15:15:53,071 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:53,079 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:15:53,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:15:53,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:53,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:15:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,107 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-11-09 15:15:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:53,244 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-11-09 15:15:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:15:53,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 15:15:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:53,287 INFO L225 Difference]: With dead ends: 812 [2020-11-09 15:15:53,287 INFO L226 Difference]: Without dead ends: 662 [2020-11-09 15:15:53,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-11-09 15:15:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-11-09 15:15:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-11-09 15:15:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-11-09 15:15:53,467 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 3 [2020-11-09 15:15:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:53,468 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-11-09 15:15:53,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:15:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-11-09 15:15:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:15:53,470 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:53,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:53,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:15:53,470 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1049981946, now seen corresponding path program 1 times [2020-11-09 15:15:53,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:53,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438575000] [2020-11-09 15:15:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:53,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438575000] [2020-11-09 15:15:53,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:53,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:15:53,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356435789] [2020-11-09 15:15:53,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:53,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:53,571 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:15:53,571 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:53,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:15:53,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:15:53,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:15:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,576 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-11-09 15:15:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:53,596 INFO L93 Difference]: Finished difference Result 650 states and 2014 transitions. [2020-11-09 15:15:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:15:53,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:15:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:53,605 INFO L225 Difference]: With dead ends: 650 [2020-11-09 15:15:53,606 INFO L226 Difference]: Without dead ends: 650 [2020-11-09 15:15:53,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-09 15:15:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-09 15:15:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-09 15:15:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2014 transitions. [2020-11-09 15:15:53,647 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2014 transitions. Word has length 9 [2020-11-09 15:15:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:53,648 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2014 transitions. [2020-11-09 15:15:53,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:15:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2014 transitions. [2020-11-09 15:15:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:15:53,651 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:53,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:53,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:15:53,651 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2074062769, now seen corresponding path program 1 times [2020-11-09 15:15:53,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:53,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57237026] [2020-11-09 15:15:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:53,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57237026] [2020-11-09 15:15:53,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:53,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:15:53,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716822650] [2020-11-09 15:15:53,829 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:53,833 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:53,840 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-11-09 15:15:53,841 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:53,967 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:15:53,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:15:53,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:53,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:15:53,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,969 INFO L87 Difference]: Start difference. First operand 650 states and 2014 transitions. Second operand 3 states. [2020-11-09 15:15:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:53,985 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-11-09 15:15:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:15:53,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:15:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:53,992 INFO L225 Difference]: With dead ends: 604 [2020-11-09 15:15:53,992 INFO L226 Difference]: Without dead ends: 604 [2020-11-09 15:15:53,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-11-09 15:15:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-11-09 15:15:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-11-09 15:15:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-11-09 15:15:54,026 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 10 [2020-11-09 15:15:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:54,026 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-11-09 15:15:54,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:15:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-11-09 15:15:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:15:54,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:54,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:54,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:15:54,031 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:54,032 INFO L82 PathProgramCache]: Analyzing trace with hash 297611459, now seen corresponding path program 1 times [2020-11-09 15:15:54,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:54,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486290628] [2020-11-09 15:15:54,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:54,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486290628] [2020-11-09 15:15:54,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:54,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:15:54,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1612519814] [2020-11-09 15:15:54,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:54,195 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:54,199 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 44 transitions. [2020-11-09 15:15:54,200 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:54,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:15:54,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:15:54,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:15:54,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:15:54,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:15:54,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:15:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:15:54,608 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 4 states. [2020-11-09 15:15:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:54,668 INFO L93 Difference]: Finished difference Result 552 states and 1487 transitions. [2020-11-09 15:15:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:15:54,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 15:15:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:54,672 INFO L225 Difference]: With dead ends: 552 [2020-11-09 15:15:54,672 INFO L226 Difference]: Without dead ends: 402 [2020-11-09 15:15:54,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:15:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-11-09 15:15:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2020-11-09 15:15:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2020-11-09 15:15:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1042 transitions. [2020-11-09 15:15:54,691 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1042 transitions. Word has length 12 [2020-11-09 15:15:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:54,692 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 1042 transitions. [2020-11-09 15:15:54,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:15:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1042 transitions. [2020-11-09 15:15:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:15:54,694 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:54,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:54,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:15:54,695 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash 592971748, now seen corresponding path program 1 times [2020-11-09 15:15:54,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:54,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342076580] [2020-11-09 15:15:54,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:54,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342076580] [2020-11-09 15:15:54,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:54,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:15:54,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411009331] [2020-11-09 15:15:54,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:54,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:54,786 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2020-11-09 15:15:54,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:54,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:54,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:54,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:54,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:54,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:54,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:54,996 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:54,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:54,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:54,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:54,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,208 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,258 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,259 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,286 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:15:55,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:15:55,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:55,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:15:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:55,289 INFO L87 Difference]: Start difference. First operand 402 states and 1042 transitions. Second operand 3 states. [2020-11-09 15:15:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:55,306 INFO L93 Difference]: Finished difference Result 597 states and 1505 transitions. [2020-11-09 15:15:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:15:55,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-11-09 15:15:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:55,311 INFO L225 Difference]: With dead ends: 597 [2020-11-09 15:15:55,311 INFO L226 Difference]: Without dead ends: 417 [2020-11-09 15:15:55,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:15:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-09 15:15:55,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 396. [2020-11-09 15:15:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-11-09 15:15:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 975 transitions. [2020-11-09 15:15:55,329 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 975 transitions. Word has length 15 [2020-11-09 15:15:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:55,329 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 975 transitions. [2020-11-09 15:15:55,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:15:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 975 transitions. [2020-11-09 15:15:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:15:55,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:55,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:55,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:15:55,332 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:55,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1246917057, now seen corresponding path program 1 times [2020-11-09 15:15:55,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:55,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727150811] [2020-11-09 15:15:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:55,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727150811] [2020-11-09 15:15:55,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:55,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:15:55,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [984655123] [2020-11-09 15:15:55,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:55,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:55,486 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-11-09 15:15:55,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:55,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:55,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:55,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:55,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:55,800 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10727#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:15:55,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:15:55,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:15:55,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:15:55,802 INFO L87 Difference]: Start difference. First operand 396 states and 975 transitions. Second operand 6 states. [2020-11-09 15:15:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:55,905 INFO L93 Difference]: Finished difference Result 321 states and 728 transitions. [2020-11-09 15:15:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:15:55,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 15:15:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:55,908 INFO L225 Difference]: With dead ends: 321 [2020-11-09 15:15:55,908 INFO L226 Difference]: Without dead ends: 251 [2020-11-09 15:15:55,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:15:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-11-09 15:15:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2020-11-09 15:15:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2020-11-09 15:15:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 556 transitions. [2020-11-09 15:15:55,917 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 556 transitions. Word has length 15 [2020-11-09 15:15:55,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:55,917 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 556 transitions. [2020-11-09 15:15:55,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:15:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 556 transitions. [2020-11-09 15:15:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 15:15:55,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:55,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:55,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:15:55,919 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2035129400, now seen corresponding path program 1 times [2020-11-09 15:15:55,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:55,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603724127] [2020-11-09 15:15:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:56,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603724127] [2020-11-09 15:15:56,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:56,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:15:56,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612227045] [2020-11-09 15:15:56,100 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:56,108 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:56,127 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 52 transitions. [2020-11-09 15:15:56,127 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:56,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:56,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:56,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:15:56,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,232 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:15:56,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:56,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,307 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:56,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:56,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:56,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,446 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:56,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:56,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:56,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:56,576 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11559#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:15:56,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:15:56,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:15:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:15:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:15:56,580 INFO L87 Difference]: Start difference. First operand 251 states and 556 transitions. Second operand 7 states. [2020-11-09 15:15:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:15:56,688 INFO L93 Difference]: Finished difference Result 229 states and 511 transitions. [2020-11-09 15:15:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:15:56,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-11-09 15:15:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:15:56,691 INFO L225 Difference]: With dead ends: 229 [2020-11-09 15:15:56,692 INFO L226 Difference]: Without dead ends: 151 [2020-11-09 15:15:56,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:15:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-09 15:15:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2020-11-09 15:15:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-11-09 15:15:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 334 transitions. [2020-11-09 15:15:56,701 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 334 transitions. Word has length 18 [2020-11-09 15:15:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:15:56,701 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 334 transitions. [2020-11-09 15:15:56,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:15:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 334 transitions. [2020-11-09 15:15:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:15:56,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:15:56,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:15:56,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:15:56,703 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:15:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:15:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 810973104, now seen corresponding path program 1 times [2020-11-09 15:15:56,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:15:56,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119090660] [2020-11-09 15:15:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:15:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:15:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:15:57,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119090660] [2020-11-09 15:15:57,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:15:57,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:15:57,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [421555770] [2020-11-09 15:15:57,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:15:57,235 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:15:57,313 INFO L252 McrAutomatonBuilder]: Finished intersection with 112 states and 216 transitions. [2020-11-09 15:15:57,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:15:57,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,324 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,327 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:57,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:15:57,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,376 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:15:57,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:15:57,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,410 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:15:57,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,414 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,462 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:57,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,463 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:57,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:57,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:15:57,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:15:57,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,694 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:15:57,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:15:57,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:15:57,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,792 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:57,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,798 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:57,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,878 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:15:57,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:15:57,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:57,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:57,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:57,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:15:57,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:57,887 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 4, 1] term [2020-11-09 15:15:57,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:57,890 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:15:57,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:58,230 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 23 [2020-11-09 15:15:58,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:58,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,317 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:58,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:15:58,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:15:58,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,381 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:15:58,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:58,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,541 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:58,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:58,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:15:58,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:15:58,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:15:58,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:58,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:15:58,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:15:58,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:58,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:58,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:58,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:15:58,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:58,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 4, 1] term [2020-11-09 15:15:58,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:58,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:15:58,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:59,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:59,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:15:59,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:15:59,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:15:59,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:59,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:15:59,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:15:59,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,198 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:59,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:15:59,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:59,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:15:59,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,930 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 25 [2020-11-09 15:15:59,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:15:59,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:15:59,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:15:59,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:15:59,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:15:59,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:15:59,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:15:59,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:16:00,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,395 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:00,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:00,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:16:00,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:16:00,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:00,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,483 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:16:00,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,484 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:16:00,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:16:00,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:00,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:16:00,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:16:00,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:00,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:00,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:16:00,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:00,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:16:00,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:16:01,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:16:01,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:01,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:16:01,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:01,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:16:01,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:16:01,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:16:01,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:01,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 1] term [2020-11-09 15:16:01,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:01,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:16:01,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:16:01,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:16:01,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:01,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:01,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:16:01,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:01,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:16:01,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:16:02,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:16:02,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,127 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:02,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:16:02,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:02,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:16:02,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:16:02,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:16:02,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:16:02,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:02,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 1] term [2020-11-09 15:16:02,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:16:02,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:16:02,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:16:03,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [12100#(and (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$w_buff0~0 ~z~0) (= ~z~0 1) (= ~z$r_buff1_thd3~0 0)), 12101#(and (= (mod ~z$w_buff1_used~0 256) 0) (or (= ~z$w_buff0~0 ~z~0) (not (= (mod ~z$r_buff0_thd1~0 256) 0))) (= ~z$w_buff0~0 1) (= ~z$r_buff1_thd3~0 0) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0~0 ~z~0))), 12102#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1) (or (= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (not (= (mod ~z$r_buff0_thd1~0 256) 0))) (= ~z$r_buff1_thd3~0 0) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0~0 ~z~0))), 12103#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0)), 12104#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0)))] [2020-11-09 15:16:03,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 15:16:03,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:16:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 15:16:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:16:03,262 INFO L87 Difference]: Start difference. First operand 151 states and 334 transitions. Second operand 12 states. [2020-11-09 15:16:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:16:03,663 INFO L93 Difference]: Finished difference Result 195 states and 424 transitions. [2020-11-09 15:16:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:16:03,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-11-09 15:16:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:16:03,665 INFO L225 Difference]: With dead ends: 195 [2020-11-09 15:16:03,665 INFO L226 Difference]: Without dead ends: 109 [2020-11-09 15:16:03,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 26 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:16:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-09 15:16:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2020-11-09 15:16:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-09 15:16:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 186 transitions. [2020-11-09 15:16:03,672 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 186 transitions. Word has length 22 [2020-11-09 15:16:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:16:03,673 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 186 transitions. [2020-11-09 15:16:03,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 15:16:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 186 transitions. [2020-11-09 15:16:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 15:16:03,674 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:16:03,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:16:03,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:16:03,674 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:16:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:16:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1677771472, now seen corresponding path program 2 times [2020-11-09 15:16:03,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:16:03,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924472030] [2020-11-09 15:16:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:16:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:16:03,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:16:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:16:03,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:16:04,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:16:04,091 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:16:04,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:16:04,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:16:04 BasicIcfg [2020-11-09 15:16:04,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:16:04,249 INFO L168 Benchmark]: Toolchain (without parser) took 26865.51 ms. Allocated memory was 151.0 MB in the beginning and 335.5 MB in the end (delta: 184.5 MB). Free memory was 125.0 MB in the beginning and 274.3 MB in the end (delta: -149.4 MB). Peak memory consumption was 222.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,250 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:16:04,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.01 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 122.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.32 ms. Allocated memory is still 151.0 MB. Free memory was 122.7 MB in the beginning and 120.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,253 INFO L168 Benchmark]: Boogie Preprocessor took 74.03 ms. Allocated memory is still 151.0 MB. Free memory was 120.2 MB in the beginning and 118.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,254 INFO L168 Benchmark]: RCFGBuilder took 3392.35 ms. Allocated memory was 151.0 MB in the beginning and 182.5 MB in the end (delta: 31.5 MB). Free memory was 118.1 MB in the beginning and 80.1 MB in the end (delta: 38.0 MB). Peak memory consumption was 76.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,256 INFO L168 Benchmark]: TraceAbstraction took 22380.34 ms. Allocated memory was 182.5 MB in the beginning and 335.5 MB in the end (delta: 153.1 MB). Free memory was 79.6 MB in the beginning and 274.3 MB in the end (delta: -194.7 MB). Peak memory consumption was 144.5 MB. Max. memory is 8.0 GB. [2020-11-09 15:16:04,261 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 921.01 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 122.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 80.32 ms. Allocated memory is still 151.0 MB. Free memory was 122.7 MB in the beginning and 120.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.03 ms. Allocated memory is still 151.0 MB. Free memory was 120.2 MB in the beginning and 118.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3392.35 ms. Allocated memory was 151.0 MB in the beginning and 182.5 MB in the end (delta: 31.5 MB). Free memory was 118.1 MB in the beginning and 80.1 MB in the end (delta: 38.0 MB). Peak memory consumption was 76.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22380.34 ms. Allocated memory was 182.5 MB in the beginning and 335.5 MB in the end (delta: 153.1 MB). Free memory was 79.6 MB in the beginning and 274.3 MB in the end (delta: -194.7 MB). Peak memory consumption was 144.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1082 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 93 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 110 PlacesBefore, 37 PlacesAfterwards, 103 TransitionsBefore, 28 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 6047 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t751; [L837] FCALL, FORK 0 pthread_create(&t751, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t752; [L839] FCALL, FORK 0 pthread_create(&t752, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t753; [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L841] FCALL, FORK 0 pthread_create(&t753, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix028_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 218 SDtfs, 218 SDslu, 414 SDs, 0 SdLazy, 174 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 40 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 8124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...