/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 21:42:54,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 21:42:54,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 21:42:54,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 21:42:54,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 21:42:54,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 21:42:54,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 21:42:54,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 21:42:54,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 21:42:54,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 21:42:54,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 21:42:54,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 21:42:54,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 21:42:54,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 21:42:54,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 21:42:54,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 21:42:54,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 21:42:54,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 21:42:54,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 21:42:54,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 21:42:54,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 21:42:54,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 21:42:54,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 21:42:54,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 21:42:54,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 21:42:54,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 21:42:54,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 21:42:54,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 21:42:54,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 21:42:54,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 21:42:54,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 21:42:54,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 21:42:54,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 21:42:54,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 21:42:54,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 21:42:54,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 21:42:54,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 21:42:54,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 21:42:54,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 21:42:54,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 21:42:54,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 21:42:54,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 21:42:54,526 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 21:42:54,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 21:42:54,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 21:42:54,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 21:42:54,527 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 21:42:54,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 21:42:54,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 21:42:54,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 21:42:54,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 21:42:54,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 21:42:54,529 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 21:42:54,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 21:42:54,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 21:42:54,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 21:42:54,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 21:42:54,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 21:42:54,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:42:54,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 21:42:54,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 21:42:54,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 21:42:54,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 21:42:54,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 21:42:54,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 21:42:54,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 21:42:54,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 21:42:54,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 21:42:54,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 21:42:54,810 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 21:42:54,810 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 21:42:54,811 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i [2020-10-15 21:42:54,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c805c031c/81b9f4633302446b83be9e4326eff3fb/FLAGefbe7fae8 [2020-10-15 21:42:55,435 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 21:42:55,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_rmo.opt.i [2020-10-15 21:42:55,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c805c031c/81b9f4633302446b83be9e4326eff3fb/FLAGefbe7fae8 [2020-10-15 21:42:55,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c805c031c/81b9f4633302446b83be9e4326eff3fb [2020-10-15 21:42:55,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 21:42:55,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 21:42:55,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 21:42:55,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 21:42:55,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 21:42:55,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:42:55" (1/1) ... [2020-10-15 21:42:55,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45090060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:55, skipping insertion in model container [2020-10-15 21:42:55,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:42:55" (1/1) ... [2020-10-15 21:42:55,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 21:42:55,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 21:42:56,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:42:56,260 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 21:42:56,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:42:56,421 INFO L208 MainTranslator]: Completed translation [2020-10-15 21:42:56,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56 WrapperNode [2020-10-15 21:42:56,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 21:42:56,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 21:42:56,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 21:42:56,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 21:42:56,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 21:42:56,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 21:42:56,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 21:42:56,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 21:42:56,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (1/1) ... [2020-10-15 21:42:56,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 21:42:56,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 21:42:56,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 21:42:56,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 21:42:56,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (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-10-15 21:42:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 21:42:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 21:42:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 21:42:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 21:42:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 21:42:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 21:42:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 21:42:56,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 21:42:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 21:42:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 21:42:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 21:42:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 21:42:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 21:42:56,607 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 21:42:58,785 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 21:42:58,785 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 21:42:58,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:42:58 BoogieIcfgContainer [2020-10-15 21:42:58,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 21:42:58,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 21:42:58,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 21:42:58,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 21:42:58,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:42:55" (1/3) ... [2020-10-15 21:42:58,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37062188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:42:58, skipping insertion in model container [2020-10-15 21:42:58,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:42:56" (2/3) ... [2020-10-15 21:42:58,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37062188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:42:58, skipping insertion in model container [2020-10-15 21:42:58,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:42:58" (3/3) ... [2020-10-15 21:42:58,794 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_rmo.opt.i [2020-10-15 21:42:58,805 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 21:42:58,806 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 21:42:58,813 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 21:42:58,814 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 21:42:58,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,859 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,859 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,874 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,879 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,880 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,883 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,883 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,888 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:42:58,908 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 21:42:58,927 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 21:42:58,928 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 21:42:58,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 21:42:58,928 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 21:42:58,928 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 21:42:58,928 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 21:42:58,928 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 21:42:58,929 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 21:42:58,941 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 21:42:58,944 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-15 21:42:58,946 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-15 21:42:58,948 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2020-10-15 21:42:58,995 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2020-10-15 21:42:58,996 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 21:42:59,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-15 21:42:59,004 INFO L117 LiptonReduction]: Number of co-enabled transitions 1814 [2020-10-15 21:42:59,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:42:59,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:42:59,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:42:59,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:42:59,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:42:59,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:42:59,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:42:59,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:42:59,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:42:59,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:42:59,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:42:59,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:42:59,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:42:59,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:42:59,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:42:59,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:42:59,949 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 21:43:00,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:43:00,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:00,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:43:00,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:00,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:00,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:00,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:00,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:00,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:00,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:43:00,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:00,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:00,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:00,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:00,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:00,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:00,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,188 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 21:43:01,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:43:01,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:01,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:01,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:01,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:01,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:01,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:01,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:01,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:01,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:01,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:01,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:01,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:01,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:01,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:01,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:01,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:01,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:01,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:01,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:02,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:02,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:02,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:02,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:02,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:43:02,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:43:02,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:02,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:02,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:43:02,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:02,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:43:02,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:43:02,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:43:02,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:43:02,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:43:02,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:43:03,550 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-15 21:43:03,680 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-15 21:43:03,776 INFO L132 LiptonReduction]: Checked pairs total: 5577 [2020-10-15 21:43:03,776 INFO L134 LiptonReduction]: Total number of compositions: 85 [2020-10-15 21:43:03,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-15 21:43:03,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 937 states. [2020-10-15 21:43:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states. [2020-10-15 21:43:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 21:43:03,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:03,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:03,871 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:03,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:03,877 INFO L82 PathProgramCache]: Analyzing trace with hash -621540055, now seen corresponding path program 1 times [2020-10-15 21:43:03,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:03,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63166481] [2020-10-15 21:43:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:04,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63166481] [2020-10-15 21:43:04,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:04,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:43:04,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474137204] [2020-10-15 21:43:04,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:43:04,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:43:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:43:04,267 INFO L87 Difference]: Start difference. First operand 937 states. Second operand 3 states. [2020-10-15 21:43:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:04,362 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-15 21:43:04,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:43:04,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 21:43:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:04,390 INFO L225 Difference]: With dead ends: 812 [2020-10-15 21:43:04,391 INFO L226 Difference]: Without dead ends: 662 [2020-10-15 21:43:04,392 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-10-15 21:43:04,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-15 21:43:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-15 21:43:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-15 21:43:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-15 21:43:04,496 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7 [2020-10-15 21:43:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:04,497 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-15 21:43:04,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:43:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-15 21:43:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 21:43:04,499 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:04,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:04,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 21:43:04,500 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -299474295, now seen corresponding path program 1 times [2020-10-15 21:43:04,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:04,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451455247] [2020-10-15 21:43:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:04,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451455247] [2020-10-15 21:43:04,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:04,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:43:04,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582164278] [2020-10-15 21:43:04,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:43:04,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:04,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:43:04,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:43:04,612 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-15 21:43:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:04,648 INFO L93 Difference]: Finished difference Result 602 states and 1842 transitions. [2020-10-15 21:43:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:43:04,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 21:43:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:04,659 INFO L225 Difference]: With dead ends: 602 [2020-10-15 21:43:04,659 INFO L226 Difference]: Without dead ends: 602 [2020-10-15 21:43:04,660 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-10-15 21:43:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-10-15 21:43:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2020-10-15 21:43:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-15 21:43:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1842 transitions. [2020-10-15 21:43:04,697 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1842 transitions. Word has length 9 [2020-10-15 21:43:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:04,698 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1842 transitions. [2020-10-15 21:43:04,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:43:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1842 transitions. [2020-10-15 21:43:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 21:43:04,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:04,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:04,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 21:43:04,704 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -448103436, now seen corresponding path program 1 times [2020-10-15 21:43:04,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:04,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855113308] [2020-10-15 21:43:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:04,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855113308] [2020-10-15 21:43:04,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:04,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:43:04,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699047014] [2020-10-15 21:43:04,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:43:04,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:04,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:43:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:43:04,784 INFO L87 Difference]: Start difference. First operand 602 states and 1842 transitions. Second operand 3 states. [2020-10-15 21:43:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:04,798 INFO L93 Difference]: Finished difference Result 566 states and 1716 transitions. [2020-10-15 21:43:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:43:04,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 21:43:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:04,805 INFO L225 Difference]: With dead ends: 566 [2020-10-15 21:43:04,805 INFO L226 Difference]: Without dead ends: 566 [2020-10-15 21:43:04,805 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-10-15 21:43:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-10-15 21:43:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2020-10-15 21:43:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-10-15 21:43:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1716 transitions. [2020-10-15 21:43:04,832 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1716 transitions. Word has length 11 [2020-10-15 21:43:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:04,833 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 1716 transitions. [2020-10-15 21:43:04,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:43:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1716 transitions. [2020-10-15 21:43:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 21:43:04,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:04,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:04,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 21:43:04,836 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash -507490775, now seen corresponding path program 1 times [2020-10-15 21:43:04,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:04,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102871127] [2020-10-15 21:43:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:04,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102871127] [2020-10-15 21:43:04,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:04,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:43:04,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929908598] [2020-10-15 21:43:04,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:43:04,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:43:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:43:04,902 INFO L87 Difference]: Start difference. First operand 566 states and 1716 transitions. Second operand 3 states. [2020-10-15 21:43:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:04,933 INFO L93 Difference]: Finished difference Result 548 states and 1656 transitions. [2020-10-15 21:43:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:43:04,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 21:43:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:04,940 INFO L225 Difference]: With dead ends: 548 [2020-10-15 21:43:04,941 INFO L226 Difference]: Without dead ends: 548 [2020-10-15 21:43:04,941 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-10-15 21:43:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-15 21:43:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-15 21:43:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-15 21:43:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions. [2020-10-15 21:43:04,967 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13 [2020-10-15 21:43:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:04,968 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions. [2020-10-15 21:43:04,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:43:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions. [2020-10-15 21:43:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:43:04,974 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:04,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:04,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 21:43:04,974 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:04,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1900332105, now seen corresponding path program 1 times [2020-10-15 21:43:04,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:04,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444595887] [2020-10-15 21:43:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:05,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444595887] [2020-10-15 21:43:05,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:05,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:43:05,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637983868] [2020-10-15 21:43:05,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:43:05,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:43:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:43:05,216 INFO L87 Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand 4 states. [2020-10-15 21:43:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:05,293 INFO L93 Difference]: Finished difference Result 526 states and 1413 transitions. [2020-10-15 21:43:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:43:05,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-15 21:43:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:05,298 INFO L225 Difference]: With dead ends: 526 [2020-10-15 21:43:05,298 INFO L226 Difference]: Without dead ends: 376 [2020-10-15 21:43:05,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:43:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-15 21:43:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2020-10-15 21:43:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-10-15 21:43:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 968 transitions. [2020-10-15 21:43:05,316 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 968 transitions. Word has length 15 [2020-10-15 21:43:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:05,317 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 968 transitions. [2020-10-15 21:43:05,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:43:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 968 transitions. [2020-10-15 21:43:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:43:05,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:05,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:05,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 21:43:05,320 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:05,320 INFO L82 PathProgramCache]: Analyzing trace with hash 525968040, now seen corresponding path program 1 times [2020-10-15 21:43:05,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:05,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431337213] [2020-10-15 21:43:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:05,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431337213] [2020-10-15 21:43:05,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:05,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:43:05,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797932853] [2020-10-15 21:43:05,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:43:05,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:05,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:43:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:43:05,484 INFO L87 Difference]: Start difference. First operand 376 states and 968 transitions. Second operand 5 states. [2020-10-15 21:43:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:05,544 INFO L93 Difference]: Finished difference Result 318 states and 765 transitions. [2020-10-15 21:43:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:43:05,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-15 21:43:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:05,546 INFO L225 Difference]: With dead ends: 318 [2020-10-15 21:43:05,546 INFO L226 Difference]: Without dead ends: 248 [2020-10-15 21:43:05,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:43:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-15 21:43:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-15 21:43:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-15 21:43:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions. [2020-10-15 21:43:05,560 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 17 [2020-10-15 21:43:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:05,560 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 584 transitions. [2020-10-15 21:43:05,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:43:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions. [2020-10-15 21:43:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 21:43:05,561 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:05,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:43:05,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 21:43:05,562 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:05,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1751165511, now seen corresponding path program 1 times [2020-10-15 21:43:05,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:05,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631983244] [2020-10-15 21:43:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:05,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631983244] [2020-10-15 21:43:05,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:05,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:43:05,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109558717] [2020-10-15 21:43:05,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:43:05,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:05,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:43:05,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:43:05,723 INFO L87 Difference]: Start difference. First operand 248 states and 584 transitions. Second operand 6 states. [2020-10-15 21:43:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:05,777 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions. [2020-10-15 21:43:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 21:43:05,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-15 21:43:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:05,779 INFO L225 Difference]: With dead ends: 229 [2020-10-15 21:43:05,780 INFO L226 Difference]: Without dead ends: 215 [2020-10-15 21:43:05,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:43:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-15 21:43:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2020-10-15 21:43:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-15 21:43:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2020-10-15 21:43:05,786 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 19 [2020-10-15 21:43:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:05,786 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2020-10-15 21:43:05,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:43:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2020-10-15 21:43:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 21:43:05,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:05,787 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-10-15 21:43:05,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 21:43:05,788 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 567042970, now seen corresponding path program 1 times [2020-10-15 21:43:05,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:05,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161243495] [2020-10-15 21:43:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:05,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161243495] [2020-10-15 21:43:05,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:05,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:43:05,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933978947] [2020-10-15 21:43:05,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:43:05,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:05,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:43:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:43:05,849 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 4 states. [2020-10-15 21:43:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:05,874 INFO L93 Difference]: Finished difference Result 277 states and 653 transitions. [2020-10-15 21:43:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:43:05,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-15 21:43:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:05,876 INFO L225 Difference]: With dead ends: 277 [2020-10-15 21:43:05,876 INFO L226 Difference]: Without dead ends: 107 [2020-10-15 21:43:05,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:43:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-15 21:43:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-15 21:43:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-15 21:43:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions. [2020-10-15 21:43:05,880 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22 [2020-10-15 21:43:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:05,880 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions. [2020-10-15 21:43:05,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:43:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions. [2020-10-15 21:43:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 21:43:05,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:05,881 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-10-15 21:43:05,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 21:43:05,882 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -478950482, now seen corresponding path program 2 times [2020-10-15 21:43:05,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:05,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825378760] [2020-10-15 21:43:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:05,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825378760] [2020-10-15 21:43:05,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:05,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:43:05,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259391467] [2020-10-15 21:43:05,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:43:05,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:43:05,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:43:05,965 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 4 states. [2020-10-15 21:43:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:05,987 INFO L93 Difference]: Finished difference Result 133 states and 270 transitions. [2020-10-15 21:43:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:43:05,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-15 21:43:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:05,988 INFO L225 Difference]: With dead ends: 133 [2020-10-15 21:43:05,988 INFO L226 Difference]: Without dead ends: 51 [2020-10-15 21:43:05,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:43:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-15 21:43:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-15 21:43:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-15 21:43:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-15 21:43:05,991 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-15 21:43:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:05,991 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-15 21:43:05,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:43:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-15 21:43:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 21:43:05,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:05,993 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-10-15 21:43:05,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 21:43:05,994 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash -628070226, now seen corresponding path program 3 times [2020-10-15 21:43:05,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:05,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029737130] [2020-10-15 21:43:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:43:06,529 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2020-10-15 21:43:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:43:06,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029737130] [2020-10-15 21:43:06,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:43:06,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:43:06,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248873269] [2020-10-15 21:43:06,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:43:06,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:43:06,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:43:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:43:06,567 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2020-10-15 21:43:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:43:06,713 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions. [2020-10-15 21:43:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:43:06,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 21:43:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:43:06,714 INFO L225 Difference]: With dead ends: 61 [2020-10-15 21:43:06,714 INFO L226 Difference]: Without dead ends: 33 [2020-10-15 21:43:06,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 21:43:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-10-15 21:43:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-15 21:43:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-15 21:43:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-10-15 21:43:06,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2020-10-15 21:43:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:43:06,718 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-10-15 21:43:06,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:43:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-10-15 21:43:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 21:43:06,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:43:06,719 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-10-15 21:43:06,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 21:43:06,719 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:43:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:43:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 515881070, now seen corresponding path program 4 times [2020-10-15 21:43:06,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:43:06,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409122067] [2020-10-15 21:43:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:43:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:43:06,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:43:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:43:06,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:43:06,909 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 21:43:06,910 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 21:43:06,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 21:43:06,911 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 21:43:06,927 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L856-->L863: Formula: (let ((.cse9 (= (mod ~z$w_buff1_used~0_In1677567805 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1677567805 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In1677567805 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In1677567805 256) 0))) (let ((.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1677567805 0)) (= ~z$r_buff0_thd0~0_In1677567805 ~z$r_buff0_thd0~0_Out1677567805) (or (and .cse0 (= ~z$w_buff1_used~0_Out1677567805 ~z$w_buff1_used~0_In1677567805)) (and .cse1 (= ~z$w_buff1_used~0_Out1677567805 0) .cse2)) (or (and .cse3 (= ~z$w_buff0_used~0_Out1677567805 0) .cse4) (and .cse5 (= ~z$w_buff0_used~0_In1677567805 ~z$w_buff0_used~0_Out1677567805))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1677567805 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1677567805|) (= ~z$r_buff1_thd0~0_In1677567805 ~z$r_buff1_thd0~0_Out1677567805) (or (and .cse3 .cse4 (= ~z~0_Out1677567805 ~z$w_buff0~0_In1677567805)) (and (or (and .cse0 (= ~z~0_In1677567805 ~z~0_Out1677567805)) (and .cse1 (= ~z~0_Out1677567805 ~z$w_buff1~0_In1677567805) .cse2)) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1677567805|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1677567805, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1677567805, ~z$w_buff0~0=~z$w_buff0~0_In1677567805, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1677567805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1677567805, ~z$w_buff1~0=~z$w_buff1~0_In1677567805, ~z~0=~z~0_In1677567805} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1677567805, ~z$w_buff0~0=~z$w_buff0~0_In1677567805, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1677567805, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1677567805|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1677567805|, ~z$w_buff1~0=~z$w_buff1~0_In1677567805, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1677567805|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1677567805|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1677567805|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1677567805, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1677567805|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1677567805|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1677567805, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1677567805, ~z~0=~z~0_Out1677567805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2020-10-15 21:43:06,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,940 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,940 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,943 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,943 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,949 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:06,954 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:43:06,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:43:07,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:43:07 BasicIcfg [2020-10-15 21:43:07,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 21:43:07,068 INFO L168 Benchmark]: Toolchain (without parser) took 11346.01 ms. Allocated memory was 252.7 MB in the beginning and 565.2 MB in the end (delta: 312.5 MB). Free memory was 205.5 MB in the beginning and 422.6 MB in the end (delta: -217.0 MB). Peak memory consumption was 95.4 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,069 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:43:07,069 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.66 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 205.5 MB in the beginning and 267.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.87 ms. Allocated memory is still 318.8 MB. Free memory was 267.0 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,071 INFO L168 Benchmark]: Boogie Preprocessor took 45.66 ms. Allocated memory is still 318.8 MB. Free memory was 264.4 MB in the beginning and 261.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,071 INFO L168 Benchmark]: RCFGBuilder took 2253.48 ms. Allocated memory was 318.8 MB in the beginning and 372.8 MB in the end (delta: 54.0 MB). Free memory was 261.9 MB in the beginning and 318.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 141.6 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,072 INFO L168 Benchmark]: TraceAbstraction took 8278.40 ms. Allocated memory was 372.8 MB in the beginning and 565.2 MB in the end (delta: 192.4 MB). Free memory was 318.2 MB in the beginning and 422.6 MB in the end (delta: -104.4 MB). Peak memory consumption was 88.1 MB. Max. memory is 14.2 GB. [2020-10-15 21:43:07,075 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 698.66 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 205.5 MB in the beginning and 267.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.87 ms. Allocated memory is still 318.8 MB. Free memory was 267.0 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.66 ms. Allocated memory is still 318.8 MB. Free memory was 264.4 MB in the beginning and 261.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2253.48 ms. Allocated memory was 318.8 MB in the beginning and 372.8 MB in the end (delta: 54.0 MB). Free memory was 261.9 MB in the beginning and 318.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 141.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8278.40 ms. Allocated memory was 372.8 MB in the beginning and 565.2 MB in the end (delta: 192.4 MB). Free memory was 318.2 MB in the beginning and 422.6 MB in the end (delta: -104.4 MB). Peak memory consumption was 88.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1334 VarBasedMoverChecksPositive, 89 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.8s, 108 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 5577 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p0_EBX = 0; [L704] 0 int __unbuffered_p1_EAX = 0; [L706] 0 int __unbuffered_p1_EBX = 0; [L708] 0 int __unbuffered_p2_EAX = 0; [L710] 0 int __unbuffered_p2_EBX = 0; [L712] 0 int a = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff0_thd3; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L847] 0 pthread_t t53; [L848] FCALL, FORK 0 pthread_create(&t53, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L849] 0 pthread_t t54; [L850] FCALL, FORK 0 pthread_create(&t54, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L851] 0 pthread_t t55; [L852] FCALL, FORK 0 pthread_create(&t55, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L794] 3 z$w_buff1 = z$w_buff0 [L795] 3 z$w_buff0 = 1 [L796] 3 z$w_buff1_used = z$w_buff0_used [L797] 3 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L799] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 z$flush_delayed = weak$$choice2 [L809] 3 z$mem_tmp = z [L810] 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) [L810] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L810] 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) [L810] 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) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EAX = z [L818] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L818] 3 z = z$flush_delayed ? z$mem_tmp : z [L819] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, 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=1, 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] [L822] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, 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=1, 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] [L742] 1 a = 1 [L745] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 z$flush_delayed = weak$$choice2 [L772] 2 z$mem_tmp = z [L773] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L773] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L774] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L774] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L775] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L776] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L778] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L778] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L778] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L779] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = z [L781] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L781] 2 z = z$flush_delayed ? z$mem_tmp : z [L782] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L825] 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) [L825] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L825] 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) [L825] 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) [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L826] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L827] 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 [L828] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L829] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L829] 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 [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L865] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 272 SDtfs, 209 SDslu, 407 SDs, 0 SdLazy, 139 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 17208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...