/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:46:04,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:46:04,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:46:04,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:46:04,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:46:04,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:46:04,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:46:04,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:46:04,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:46:04,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:46:04,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:46:04,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:46:04,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:46:04,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:46:04,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:46:04,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:46:04,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:46:04,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:46:04,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:46:04,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:46:04,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:46:04,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:46:04,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:46:04,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:46:04,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:46:04,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:46:04,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:46:04,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:46:04,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:46:04,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:46:04,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:46:04,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:46:04,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:46:04,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:46:04,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:46:04,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:46:04,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:46:04,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:46:04,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:46:04,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:46:04,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:46:04,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:46:04,459 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:46:04,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:46:04,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:46:04,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:46:04,462 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:46:04,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:46:04,462 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:46:04,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:46:04,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:46:04,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:46:04,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:46:04,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:46:04,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:46:04,465 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:46:04,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:46:04,465 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:46:04,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:46:04,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:46:04,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:46:04,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:46:04,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:46:04,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:46:04,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:46:04,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:46:04,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:46:04,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:46:04,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:46:04,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:46:04,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:46:04,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:46:04,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:46:04,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:46:04,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:46:04,762 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:46:04,762 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:46:04,763 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.oepc.i [2020-10-11 14:46:04,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f70cda0/1c202e9ac703403199f481038b833584/FLAGfa2837d87 [2020-10-11 14:46:05,369 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:46:05,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.oepc.i [2020-10-11 14:46:05,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f70cda0/1c202e9ac703403199f481038b833584/FLAGfa2837d87 [2020-10-11 14:46:05,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f70cda0/1c202e9ac703403199f481038b833584 [2020-10-11 14:46:05,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:46:05,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:46:05,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:46:05,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:46:05,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:46:05,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:46:05" (1/1) ... [2020-10-11 14:46:05,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d75f09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:05, skipping insertion in model container [2020-10-11 14:46:05,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:46:05" (1/1) ... [2020-10-11 14:46:05,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:46:05,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:46:06,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:46:06,389 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:46:06,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:46:06,539 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:46:06,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06 WrapperNode [2020-10-11 14:46:06,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:46:06,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:46:06,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:46:06,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:46:06,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:46:06,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:46:06,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:46:06,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:46:06,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (1/1) ... [2020-10-11 14:46:06,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:46:06,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:46:06,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:46:06,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:46:06,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (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-11 14:46:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:46:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:46:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:46:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:46:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:46:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:46:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:46:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:46:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:46:06,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:46:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 14:46:06,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 14:46:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:46:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:46:06,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:46:06,798 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:46:11,711 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:46:11,712 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-11 14:46:11,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:46:11 BoogieIcfgContainer [2020-10-11 14:46:11,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:46:11,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:46:11,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:46:11,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:46:11,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:46:05" (1/3) ... [2020-10-11 14:46:11,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fea43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:46:11, skipping insertion in model container [2020-10-11 14:46:11,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:46:06" (2/3) ... [2020-10-11 14:46:11,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354fea43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:46:11, skipping insertion in model container [2020-10-11 14:46:11,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:46:11" (3/3) ... [2020-10-11 14:46:11,723 INFO L111 eAbstractionObserver]: Analyzing ICFG mix023_tso.oepc.i [2020-10-11 14:46:11,736 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:46:11,736 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:46:11,745 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-11 14:46:11,746 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:46:11,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,790 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,794 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,795 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,811 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,811 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,812 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,812 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,821 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,830 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,854 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:46:11,868 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-11 14:46:11,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:46:11,888 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:46:11,888 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:46:11,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:46:11,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:46:11,889 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:46:11,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:46:11,889 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:46:11,903 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:46:11,906 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 286 flow [2020-10-11 14:46:11,908 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 286 flow [2020-10-11 14:46:11,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2020-10-11 14:46:11,969 INFO L129 PetriNetUnfolder]: 2/129 cut-off events. [2020-10-11 14:46:11,969 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:46:11,975 INFO L80 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-11 14:46:11,980 INFO L117 LiptonReduction]: Number of co-enabled transitions 2924 [2020-10-11 14:46:12,591 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-11 14:46:12,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:12,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:12,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:12,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:12,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:13,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:13,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:13,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:13,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:13,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:13,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:13,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 1] term [2020-10-11 14:46:13,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:13,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:13,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:13,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:13,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:13,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:17,182 WARN L193 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 432 DAG size of output: 352 [2020-10-11 14:46:17,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 2, 1] term [2020-10-11 14:46:17,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:17,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:17,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:17,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 2, 2, 1] term [2020-10-11 14:46:17,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:17,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:17,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,794 WARN L193 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 292 DAG size of output: 252 [2020-10-11 14:46:21,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:21,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:21,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:21,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:21,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:21,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:21,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:21,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:21,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:21,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,858 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-11 14:46:21,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,860 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-11 14:46:21,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:21,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:46:21,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:21,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:21,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:21,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:21,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:21,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:21,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:22,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:22,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:22,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:22,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:22,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:22,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:22,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:22,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:22,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:22,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:22,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:22,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:22,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:22,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:22,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:22,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:22,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:22,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:22,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,032 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2020-10-11 14:46:23,286 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-11 14:46:23,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:23,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:23,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:23,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:23,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:23,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:23,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:23,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:23,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:23,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,495 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-11 14:46:23,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,496 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-11 14:46:23,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:23,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:46:23,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:23,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:23,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:23,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:23,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:23,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-11 14:46:23,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 6, 3, 2, 1] term [2020-10-11 14:46:23,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:23,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:23,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:23,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:23,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:23,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:24,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:24,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:24,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:24,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:24,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:24,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:24,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:24,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:24,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:24,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:24,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:25,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:25,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:25,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:25,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:25,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:25,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 1] term [2020-10-11 14:46:25,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:25,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:25,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:25,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:25,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:30,410 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 258 DAG size of output: 236 [2020-10-11 14:46:32,974 WARN L193 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 227 DAG size of output: 226 [2020-10-11 14:46:36,479 WARN L193 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 254 DAG size of output: 253 [2020-10-11 14:46:38,199 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 253 [2020-10-11 14:46:41,168 WARN L193 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 255 DAG size of output: 214 [2020-10-11 14:46:42,718 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 205 [2020-10-11 14:46:42,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:46:42,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:42,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:42,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:42,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:42,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:42,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:42,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:42,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:42,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:42,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:42,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:42,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:42,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:42,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:42,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:42,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:43,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:43,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:43,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:43,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:43,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:43,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:43,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:43,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:43,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:43,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:43,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:43,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:43,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:43,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:43,355 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-11 14:46:43,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:43,357 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-11 14:46:43,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:45,108 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 231 [2020-10-11 14:46:46,890 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 231 [2020-10-11 14:46:47,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,062 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-11 14:46:47,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,063 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-11 14:46:47,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:47,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:47,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:47,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:47,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:46:47,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:46:47,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:47,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,684 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-11 14:46:47,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,685 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-11 14:46:47,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:46:47,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:47,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:46:47,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,758 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-11 14:46:47,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,759 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-11 14:46:47,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:46:47,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:46:47,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:46:47,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:46:47,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:46:48,768 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-11 14:46:48,983 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-11 14:46:52,826 WARN L193 SmtUtils]: Spent 3.80 s on a formula simplification that was a NOOP. DAG size: 241 [2020-10-11 14:46:54,813 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification that was a NOOP. DAG size: 239 [2020-10-11 14:46:55,558 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 135 [2020-10-11 14:46:55,872 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-11 14:46:55,884 INFO L132 LiptonReduction]: Checked pairs total: 9711 [2020-10-11 14:46:55,884 INFO L134 LiptonReduction]: Total number of compositions: 109 [2020-10-11 14:46:55,893 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 36 transitions, 92 flow [2020-10-11 14:46:56,369 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6557 states. [2020-10-11 14:46:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6557 states. [2020-10-11 14:46:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-11 14:46:56,381 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:56,381 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-11 14:46:56,382 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1853379877, now seen corresponding path program 1 times [2020-10-11 14:46:56,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:56,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721721124] [2020-10-11 14:46:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:56,710 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-11 14:46:56,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721721124] [2020-10-11 14:46:56,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:56,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:56,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152127136] [2020-10-11 14:46:56,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:56,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:56,735 INFO L87 Difference]: Start difference. First operand 6557 states. Second operand 3 states. [2020-10-11 14:46:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:57,035 INFO L93 Difference]: Finished difference Result 5622 states and 22683 transitions. [2020-10-11 14:46:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:57,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-11 14:46:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:57,111 INFO L225 Difference]: With dead ends: 5622 [2020-10-11 14:46:57,111 INFO L226 Difference]: Without dead ends: 4872 [2020-10-11 14:46:57,113 INFO L673 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-11 14:46:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2020-10-11 14:46:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4872. [2020-10-11 14:46:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2020-10-11 14:46:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 19358 transitions. [2020-10-11 14:46:57,470 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 19358 transitions. Word has length 5 [2020-10-11 14:46:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:57,470 INFO L481 AbstractCegarLoop]: Abstraction has 4872 states and 19358 transitions. [2020-10-11 14:46:57,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 19358 transitions. [2020-10-11 14:46:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 14:46:57,473 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:57,473 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:57,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:46:57,474 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:57,474 INFO L82 PathProgramCache]: Analyzing trace with hash -439269508, now seen corresponding path program 1 times [2020-10-11 14:46:57,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:57,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709779658] [2020-10-11 14:46:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:57,554 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-11 14:46:57,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709779658] [2020-10-11 14:46:57,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:57,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:57,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867602696] [2020-10-11 14:46:57,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:57,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:57,557 INFO L87 Difference]: Start difference. First operand 4872 states and 19358 transitions. Second operand 3 states. [2020-10-11 14:46:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:57,727 INFO L93 Difference]: Finished difference Result 4122 states and 16183 transitions. [2020-10-11 14:46:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:57,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 14:46:57,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:57,774 INFO L225 Difference]: With dead ends: 4122 [2020-10-11 14:46:57,774 INFO L226 Difference]: Without dead ends: 3972 [2020-10-11 14:46:57,775 INFO L673 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-11 14:46:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-10-11 14:46:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3972. [2020-10-11 14:46:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2020-10-11 14:46:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 15668 transitions. [2020-10-11 14:46:58,010 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 15668 transitions. Word has length 9 [2020-10-11 14:46:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:58,011 INFO L481 AbstractCegarLoop]: Abstraction has 3972 states and 15668 transitions. [2020-10-11 14:46:58,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 15668 transitions. [2020-10-11 14:46:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 14:46:58,015 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:58,015 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:58,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:46:58,016 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1231061563, now seen corresponding path program 1 times [2020-10-11 14:46:58,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:58,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664588984] [2020-10-11 14:46:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:58,171 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-11 14:46:58,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664588984] [2020-10-11 14:46:58,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:58,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:58,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686071902] [2020-10-11 14:46:58,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:58,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:58,174 INFO L87 Difference]: Start difference. First operand 3972 states and 15668 transitions. Second operand 3 states. [2020-10-11 14:46:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:58,324 INFO L93 Difference]: Finished difference Result 3947 states and 15553 transitions. [2020-10-11 14:46:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:58,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-11 14:46:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:58,368 INFO L225 Difference]: With dead ends: 3947 [2020-10-11 14:46:58,368 INFO L226 Difference]: Without dead ends: 3947 [2020-10-11 14:46:58,369 INFO L673 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-11 14:46:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2020-10-11 14:46:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3947. [2020-10-11 14:46:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3947 states. [2020-10-11 14:46:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 15553 transitions. [2020-10-11 14:46:58,524 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 15553 transitions. Word has length 11 [2020-10-11 14:46:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:58,524 INFO L481 AbstractCegarLoop]: Abstraction has 3947 states and 15553 transitions. [2020-10-11 14:46:58,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 15553 transitions. [2020-10-11 14:46:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:46:58,527 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:58,527 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:58,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:46:58,527 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:58,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 944313297, now seen corresponding path program 1 times [2020-10-11 14:46:58,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:58,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375908062] [2020-10-11 14:46:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:58,615 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-11 14:46:58,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375908062] [2020-10-11 14:46:58,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:58,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:58,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638953927] [2020-10-11 14:46:58,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:58,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:58,617 INFO L87 Difference]: Start difference. First operand 3947 states and 15553 transitions. Second operand 3 states. [2020-10-11 14:46:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:58,748 INFO L93 Difference]: Finished difference Result 3922 states and 15438 transitions. [2020-10-11 14:46:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:58,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-11 14:46:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:58,772 INFO L225 Difference]: With dead ends: 3922 [2020-10-11 14:46:58,772 INFO L226 Difference]: Without dead ends: 3922 [2020-10-11 14:46:58,772 INFO L673 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-11 14:46:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2020-10-11 14:46:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3922. [2020-10-11 14:46:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2020-10-11 14:46:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 15438 transitions. [2020-10-11 14:46:58,927 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 15438 transitions. Word has length 12 [2020-10-11 14:46:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:58,927 INFO L481 AbstractCegarLoop]: Abstraction has 3922 states and 15438 transitions. [2020-10-11 14:46:58,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 15438 transitions. [2020-10-11 14:46:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:46:58,929 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:58,929 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:58,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:46:58,930 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash 489896633, now seen corresponding path program 1 times [2020-10-11 14:46:58,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:58,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078470238] [2020-10-11 14:46:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:59,033 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-11 14:46:59,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078470238] [2020-10-11 14:46:59,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:59,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:59,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838792801] [2020-10-11 14:46:59,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:59,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:59,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:59,035 INFO L87 Difference]: Start difference. First operand 3922 states and 15438 transitions. Second operand 3 states. [2020-10-11 14:46:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:59,179 INFO L93 Difference]: Finished difference Result 3797 states and 14888 transitions. [2020-10-11 14:46:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:59,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-11 14:46:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:59,201 INFO L225 Difference]: With dead ends: 3797 [2020-10-11 14:46:59,202 INFO L226 Difference]: Without dead ends: 3797 [2020-10-11 14:46:59,202 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 14:46:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2020-10-11 14:46:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3797. [2020-10-11 14:46:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2020-10-11 14:46:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 14888 transitions. [2020-10-11 14:46:59,359 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 14888 transitions. Word has length 12 [2020-10-11 14:46:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:59,359 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 14888 transitions. [2020-10-11 14:46:59,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 14888 transitions. [2020-10-11 14:46:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:46:59,361 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:59,361 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:59,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:46:59,362 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash -792959443, now seen corresponding path program 1 times [2020-10-11 14:46:59,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:59,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086306747] [2020-10-11 14:46:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:59,461 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-11 14:46:59,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086306747] [2020-10-11 14:46:59,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:59,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:59,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182885909] [2020-10-11 14:46:59,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:59,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:59,464 INFO L87 Difference]: Start difference. First operand 3797 states and 14888 transitions. Second operand 3 states. [2020-10-11 14:46:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:59,507 INFO L93 Difference]: Finished difference Result 3672 states and 14338 transitions. [2020-10-11 14:46:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:59,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-11 14:46:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:59,527 INFO L225 Difference]: With dead ends: 3672 [2020-10-11 14:46:59,527 INFO L226 Difference]: Without dead ends: 3672 [2020-10-11 14:46:59,528 INFO L673 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-11 14:46:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2020-10-11 14:46:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2020-10-11 14:46:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2020-10-11 14:46:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 14338 transitions. [2020-10-11 14:46:59,736 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 14338 transitions. Word has length 13 [2020-10-11 14:46:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:46:59,736 INFO L481 AbstractCegarLoop]: Abstraction has 3672 states and 14338 transitions. [2020-10-11 14:46:59,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:46:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 14338 transitions. [2020-10-11 14:46:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:46:59,738 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:46:59,738 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:46:59,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:46:59,739 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:46:59,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:46:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash -791060011, now seen corresponding path program 1 times [2020-10-11 14:46:59,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:46:59,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384578617] [2020-10-11 14:46:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:46:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:46:59,833 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-11 14:46:59,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384578617] [2020-10-11 14:46:59,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:46:59,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:46:59,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513576358] [2020-10-11 14:46:59,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:46:59,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:46:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:46:59,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:46:59,835 INFO L87 Difference]: Start difference. First operand 3672 states and 14338 transitions. Second operand 3 states. [2020-10-11 14:46:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:46:59,924 INFO L93 Difference]: Finished difference Result 3572 states and 13903 transitions. [2020-10-11 14:46:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:46:59,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-11 14:46:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:46:59,945 INFO L225 Difference]: With dead ends: 3572 [2020-10-11 14:46:59,945 INFO L226 Difference]: Without dead ends: 3572 [2020-10-11 14:46:59,945 INFO L673 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-11 14:46:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3572 states. [2020-10-11 14:47:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3572 to 3572. [2020-10-11 14:47:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2020-10-11 14:47:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 13903 transitions. [2020-10-11 14:47:00,079 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 13903 transitions. Word has length 13 [2020-10-11 14:47:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:00,079 INFO L481 AbstractCegarLoop]: Abstraction has 3572 states and 13903 transitions. [2020-10-11 14:47:00,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:47:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 13903 transitions. [2020-10-11 14:47:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:47:00,082 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:00,082 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:00,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:47:00,083 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1188059897, now seen corresponding path program 1 times [2020-10-11 14:47:00,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:00,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536901564] [2020-10-11 14:47:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:00,192 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-11 14:47:00,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536901564] [2020-10-11 14:47:00,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:00,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:47:00,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454127651] [2020-10-11 14:47:00,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:47:00,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:00,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:47:00,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:47:00,195 INFO L87 Difference]: Start difference. First operand 3572 states and 13903 transitions. Second operand 4 states. [2020-10-11 14:47:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:00,404 INFO L93 Difference]: Finished difference Result 3472 states and 13468 transitions. [2020-10-11 14:47:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 14:47:00,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-11 14:47:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:00,430 INFO L225 Difference]: With dead ends: 3472 [2020-10-11 14:47:00,430 INFO L226 Difference]: Without dead ends: 3472 [2020-10-11 14:47:00,430 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:47:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2020-10-11 14:47:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3472. [2020-10-11 14:47:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2020-10-11 14:47:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 13468 transitions. [2020-10-11 14:47:00,563 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 13468 transitions. Word has length 14 [2020-10-11 14:47:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:00,563 INFO L481 AbstractCegarLoop]: Abstraction has 3472 states and 13468 transitions. [2020-10-11 14:47:00,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:47:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 13468 transitions. [2020-10-11 14:47:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:47:00,567 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:00,567 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:00,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:47:00,567 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1913285067, now seen corresponding path program 1 times [2020-10-11 14:47:00,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:00,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987090368] [2020-10-11 14:47:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:00,750 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-11 14:47:00,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987090368] [2020-10-11 14:47:00,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:00,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:47:00,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879367879] [2020-10-11 14:47:00,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:47:00,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:47:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:47:00,752 INFO L87 Difference]: Start difference. First operand 3472 states and 13468 transitions. Second operand 4 states. [2020-10-11 14:47:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:00,857 INFO L93 Difference]: Finished difference Result 3428 states and 12088 transitions. [2020-10-11 14:47:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:47:00,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-11 14:47:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:00,872 INFO L225 Difference]: With dead ends: 3428 [2020-10-11 14:47:00,872 INFO L226 Difference]: Without dead ends: 2528 [2020-10-11 14:47:00,873 INFO L673 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-11 14:47:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2020-10-11 14:47:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2528. [2020-10-11 14:47:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2528 states. [2020-10-11 14:47:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 8748 transitions. [2020-10-11 14:47:00,944 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 8748 transitions. Word has length 15 [2020-10-11 14:47:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:00,944 INFO L481 AbstractCegarLoop]: Abstraction has 2528 states and 8748 transitions. [2020-10-11 14:47:00,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:47:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 8748 transitions. [2020-10-11 14:47:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 14:47:00,949 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:00,949 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:00,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:47:00,950 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 927798954, now seen corresponding path program 1 times [2020-10-11 14:47:00,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:00,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200679647] [2020-10-11 14:47:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:01,212 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-11 14:47:01,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200679647] [2020-10-11 14:47:01,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:01,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:47:01,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017445867] [2020-10-11 14:47:01,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:47:01,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:47:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:47:01,214 INFO L87 Difference]: Start difference. First operand 2528 states and 8748 transitions. Second operand 5 states. [2020-10-11 14:47:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:01,352 INFO L93 Difference]: Finished difference Result 2140 states and 6896 transitions. [2020-10-11 14:47:01,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:47:01,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-11 14:47:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:01,359 INFO L225 Difference]: With dead ends: 2140 [2020-10-11 14:47:01,359 INFO L226 Difference]: Without dead ends: 1640 [2020-10-11 14:47:01,360 INFO L673 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-11 14:47:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-10-11 14:47:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2020-10-11 14:47:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-10-11 14:47:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5196 transitions. [2020-10-11 14:47:01,398 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5196 transitions. Word has length 18 [2020-10-11 14:47:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:01,398 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 5196 transitions. [2020-10-11 14:47:01,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:47:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5196 transitions. [2020-10-11 14:47:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 14:47:01,403 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:01,403 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:01,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:47:01,403 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1825830606, now seen corresponding path program 1 times [2020-10-11 14:47:01,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:01,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555591001] [2020-10-11 14:47:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:01,706 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-11 14:47:01,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555591001] [2020-10-11 14:47:01,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:01,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:47:01,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862258862] [2020-10-11 14:47:01,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:47:01,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:47:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:47:01,708 INFO L87 Difference]: Start difference. First operand 1640 states and 5196 transitions. Second operand 6 states. [2020-10-11 14:47:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:01,861 INFO L93 Difference]: Finished difference Result 1465 states and 4632 transitions. [2020-10-11 14:47:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:47:01,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-11 14:47:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:01,870 INFO L225 Difference]: With dead ends: 1465 [2020-10-11 14:47:01,870 INFO L226 Difference]: Without dead ends: 1325 [2020-10-11 14:47:01,871 INFO L673 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-11 14:47:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2020-10-11 14:47:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2020-10-11 14:47:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-10-11 14:47:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4251 transitions. [2020-10-11 14:47:01,902 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4251 transitions. Word has length 21 [2020-10-11 14:47:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:01,903 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 4251 transitions. [2020-10-11 14:47:01,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:47:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4251 transitions. [2020-10-11 14:47:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 14:47:01,907 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:01,907 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:01,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:47:01,907 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:01,908 INFO L82 PathProgramCache]: Analyzing trace with hash -414818929, now seen corresponding path program 1 times [2020-10-11 14:47:01,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:01,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102323392] [2020-10-11 14:47:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:02,054 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-11 14:47:02,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102323392] [2020-10-11 14:47:02,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:02,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:47:02,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515352087] [2020-10-11 14:47:02,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:47:02,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:47:02,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:47:02,057 INFO L87 Difference]: Start difference. First operand 1325 states and 4251 transitions. Second operand 4 states. [2020-10-11 14:47:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:02,099 INFO L93 Difference]: Finished difference Result 1718 states and 5409 transitions. [2020-10-11 14:47:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 14:47:02,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-11 14:47:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:02,106 INFO L225 Difference]: With dead ends: 1718 [2020-10-11 14:47:02,106 INFO L226 Difference]: Without dead ends: 1328 [2020-10-11 14:47:02,107 INFO L673 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-11 14:47:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2020-10-11 14:47:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1325. [2020-10-11 14:47:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2020-10-11 14:47:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 4129 transitions. [2020-10-11 14:47:02,138 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 4129 transitions. Word has length 25 [2020-10-11 14:47:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:02,138 INFO L481 AbstractCegarLoop]: Abstraction has 1325 states and 4129 transitions. [2020-10-11 14:47:02,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:47:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 4129 transitions. [2020-10-11 14:47:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 14:47:02,142 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:02,143 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:02,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:47:02,143 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash -791977649, now seen corresponding path program 2 times [2020-10-11 14:47:02,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:02,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578176526] [2020-10-11 14:47:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:47:02,431 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-11 14:47:02,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578176526] [2020-10-11 14:47:02,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:47:02,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:47:02,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994587378] [2020-10-11 14:47:02,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:47:02,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:47:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:47:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:47:02,433 INFO L87 Difference]: Start difference. First operand 1325 states and 4129 transitions. Second operand 7 states. [2020-10-11 14:47:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:47:02,625 INFO L93 Difference]: Finished difference Result 1294 states and 4066 transitions. [2020-10-11 14:47:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:47:02,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-11 14:47:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:47:02,630 INFO L225 Difference]: With dead ends: 1294 [2020-10-11 14:47:02,631 INFO L226 Difference]: Without dead ends: 619 [2020-10-11 14:47:02,631 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:47:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2020-10-11 14:47:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2020-10-11 14:47:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2020-10-11 14:47:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1819 transitions. [2020-10-11 14:47:02,645 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1819 transitions. Word has length 25 [2020-10-11 14:47:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:47:02,645 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 1819 transitions. [2020-10-11 14:47:02,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:47:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1819 transitions. [2020-10-11 14:47:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-11 14:47:02,648 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:47:02,648 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:47:02,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 14:47:02,648 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:47:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:47:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1039618869, now seen corresponding path program 1 times [2020-10-11 14:47:02,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:47:02,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505365804] [2020-10-11 14:47:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:47:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:47:02,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:47:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:47:03,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:47:03,185 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:47:03,186 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:47:03,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 14:47:03,189 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 14:47:03,233 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [2502] [2502] L3-->L932: Formula: (let ((.cse14 (= (mod ~x$w_buff1_used~0_In-1027625566 256) 0)) (.cse15 (= (mod ~x$r_buff1_thd0~0_In-1027625566 256) 0)) (.cse13 (= (mod ~x$w_buff0_used~0_In-1027625566 256) 0)) (.cse12 (= (mod ~x$r_buff0_thd0~0_In-1027625566 256) 0)) (.cse16 (= (mod ~z$w_buff1_used~0_In-1027625566 256) 0)) (.cse17 (= (mod ~z$r_buff1_thd0~0_In-1027625566 256) 0)) (.cse19 (= (mod ~z$w_buff0_used~0_In-1027625566 256) 0)) (.cse18 (= (mod ~z$r_buff0_thd0~0_In-1027625566 256) 0))) (let ((.cse0 (or .cse19 .cse18)) (.cse1 (not .cse19)) (.cse2 (not .cse18)) (.cse6 (not .cse17)) (.cse7 (not .cse16)) (.cse8 (or .cse16 .cse17)) (.cse11 (or .cse13 .cse12)) (.cse4 (not .cse15)) (.cse5 (not .cse14)) (.cse3 (or .cse14 .cse15)) (.cse9 (not .cse13)) (.cse10 (not .cse12))) (and (= ~x$r_buff0_thd0~0_Out-1027625566 ~x$r_buff0_thd0~0_In-1027625566) (= ~z$r_buff0_thd0~0_Out-1027625566 ~z$r_buff0_thd0~0_In-1027625566) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1027625566 0)) (or (and .cse0 (= ~z$w_buff0_used~0_In-1027625566 ~z$w_buff0_used~0_Out-1027625566)) (and (= ~z$w_buff0_used~0_Out-1027625566 0) .cse1 .cse2)) (= ~x$r_buff1_thd0~0_In-1027625566 ~x$r_buff1_thd0~0_Out-1027625566) (or (and .cse3 (= ~x$w_buff1_used~0_Out-1027625566 ~x$w_buff1_used~0_In-1027625566)) (and (= ~x$w_buff1_used~0_Out-1027625566 0) .cse4 .cse5)) (or (and .cse0 (or (and .cse6 (= ~z$w_buff1~0_In-1027625566 ~z~0_Out-1027625566) .cse7) (and .cse8 (= ~z~0_In-1027625566 ~z~0_Out-1027625566)))) (and .cse1 (= ~z$w_buff0~0_In-1027625566 ~z~0_Out-1027625566) .cse2)) (or (and .cse6 .cse7 (= ~z$w_buff1_used~0_Out-1027625566 0)) (and .cse8 (= ~z$w_buff1_used~0_Out-1027625566 ~z$w_buff1_used~0_In-1027625566))) (or (and .cse9 .cse10 (= ~x$w_buff0_used~0_Out-1027625566 0)) (and (= ~x$w_buff0_used~0_In-1027625566 ~x$w_buff0_used~0_Out-1027625566) .cse11)) (= ~z$r_buff1_thd0~0_In-1027625566 ~z$r_buff1_thd0~0_Out-1027625566) (or (and .cse11 (or (and (= ~x~0_Out-1027625566 ~x$w_buff1~0_In-1027625566) .cse4 .cse5) (and .cse3 (= ~x~0_Out-1027625566 ~x~0_In-1027625566)))) (and (= ~x$w_buff0~0_In-1027625566 ~x~0_Out-1027625566) .cse9 .cse10))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1027625566, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1027625566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027625566, ~z$w_buff0~0=~z$w_buff0~0_In-1027625566, ~x$w_buff1~0=~x$w_buff1~0_In-1027625566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1027625566, ~z$w_buff1~0=~z$w_buff1~0_In-1027625566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1027625566, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1027625566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1027625566, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1027625566, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1027625566, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1027625566, ~z~0=~z~0_In-1027625566, ~x~0=~x~0_In-1027625566} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1027625566, ~z$w_buff1~0=~z$w_buff1~0_In-1027625566, ULTIMATE.start_main_#t~ite89=|ULTIMATE.start_main_#t~ite89_Out-1027625566|, ULTIMATE.start_main_#t~ite88=|ULTIMATE.start_main_#t~ite88_Out-1027625566|, ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out-1027625566|, ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out-1027625566|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1027625566, ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out-1027625566|, ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out-1027625566|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1027625566, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out-1027625566|, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1027625566|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1027625566, ULTIMATE.start_main_#t~ite90=|ULTIMATE.start_main_#t~ite90_Out-1027625566|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1027625566, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1027625566, ~z$w_buff0~0=~z$w_buff0~0_In-1027625566, ~x$w_buff1~0=~x$w_buff1~0_In-1027625566, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1027625566, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1027625566, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1027625566, ULTIMATE.start_main_#t~ite99=|ULTIMATE.start_main_#t~ite99_Out-1027625566|, ULTIMATE.start_main_#t~ite98=|ULTIMATE.start_main_#t~ite98_Out-1027625566|, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1027625566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1027625566, ~z~0=~z~0_Out-1027625566, ~x~0=~x~0_Out-1027625566} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite89, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite91, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite90, ~z~0, ~x~0] because there is no mapped edge [2020-10-11 14:47:03,249 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-11 14:47:03,249 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,251 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-11 14:47:03,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,252 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-11 14:47:03,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,252 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-11 14:47:03,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,252 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-11 14:47:03,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,253 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-11 14:47:03,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,253 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-11 14:47:03,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,253 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-11 14:47:03,253 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,254 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-11 14:47:03,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,254 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-11 14:47:03,254 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,255 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-11 14:47:03,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,255 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-11 14:47:03,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,255 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-11 14:47:03,255 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,256 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-11 14:47:03,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,256 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-11 14:47:03,256 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,261 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-11 14:47:03,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,261 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-11 14:47:03,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,263 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-11 14:47:03,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,263 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-11 14:47:03,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,263 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-11 14:47:03,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,264 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-11 14:47:03,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,264 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-11 14:47:03,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,264 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-11 14:47:03,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,265 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-11 14:47:03,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,265 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-11 14:47:03,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,265 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-11 14:47:03,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,265 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-11 14:47:03,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,266 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-11 14:47:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,266 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-11 14:47:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,266 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-11 14:47:03,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,266 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-11 14:47:03,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,267 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-11 14:47:03,267 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,268 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-11 14:47:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,268 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-11 14:47:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,268 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-11 14:47:03,268 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,268 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-11 14:47:03,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,269 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-11 14:47:03,269 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,270 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-11 14:47:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,270 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-11 14:47:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,270 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-11 14:47:03,270 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,271 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-11 14:47:03,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,271 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-11 14:47:03,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,271 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-11 14:47:03,271 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,272 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-11 14:47:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,272 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-11 14:47:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,272 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-11 14:47:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,272 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-11 14:47:03,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,273 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-11 14:47:03,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,273 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-11 14:47:03,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,273 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-11 14:47:03,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,274 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-11 14:47:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,274 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-11 14:47:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,274 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-11 14:47:03,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,275 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-11 14:47:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,275 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-11 14:47:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,275 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-11 14:47:03,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,276 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-11 14:47:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,276 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-11 14:47:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,276 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-11 14:47:03,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,277 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-11 14:47:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,277 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-11 14:47:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,277 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-11 14:47:03,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,278 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-11 14:47:03,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,280 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-11 14:47:03,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,280 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-11 14:47:03,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,281 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-11 14:47:03,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,281 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-11 14:47:03,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,281 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-11 14:47:03,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,281 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-11 14:47:03,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,282 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-11 14:47:03,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,282 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-11 14:47:03,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,282 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-11 14:47:03,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,283 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-11 14:47:03,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,283 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-11 14:47:03,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,283 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-11 14:47:03,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,283 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-11 14:47:03,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,284 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-11 14:47:03,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,284 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-11 14:47:03,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,284 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-11 14:47:03,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,285 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-11 14:47:03,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,285 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-11 14:47:03,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,285 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-11 14:47:03,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,286 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-11 14:47:03,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,286 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-11 14:47:03,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,286 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-11 14:47:03,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,287 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-11 14:47:03,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,287 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-11 14:47:03,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,287 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-11 14:47:03,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,288 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-11 14:47:03,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:47:03,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:47:03 BasicIcfg [2020-10-11 14:47:03,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:47:03,417 INFO L168 Benchmark]: Toolchain (without parser) took 57740.70 ms. Allocated memory was 253.2 MB in the beginning and 814.7 MB in the end (delta: 561.5 MB). Free memory was 208.3 MB in the beginning and 606.8 MB in the end (delta: -398.4 MB). Peak memory consumption was 649.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,418 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:47:03,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.17 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 208.3 MB in the beginning and 260.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.47 ms. Allocated memory is still 320.3 MB. Free memory was 260.9 MB in the beginning and 255.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,420 INFO L168 Benchmark]: Boogie Preprocessor took 62.03 ms. Allocated memory is still 320.3 MB. Free memory was 255.9 MB in the beginning and 250.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,420 INFO L168 Benchmark]: RCFGBuilder took 5004.11 ms. Allocated memory was 320.3 MB in the beginning and 427.3 MB in the end (delta: 107.0 MB). Free memory was 250.8 MB in the beginning and 315.3 MB in the end (delta: -64.5 MB). Peak memory consumption was 195.8 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,421 INFO L168 Benchmark]: TraceAbstraction took 51699.69 ms. Allocated memory was 427.3 MB in the beginning and 814.7 MB in the end (delta: 387.4 MB). Free memory was 315.3 MB in the beginning and 606.8 MB in the end (delta: -291.5 MB). Peak memory consumption was 582.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:47:03,425 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.24 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 861.17 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 208.3 MB in the beginning and 260.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 29.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 107.47 ms. Allocated memory is still 320.3 MB. Free memory was 260.9 MB in the beginning and 255.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 62.03 ms. Allocated memory is still 320.3 MB. Free memory was 255.9 MB in the beginning and 250.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * RCFGBuilder took 5004.11 ms. Allocated memory was 320.3 MB in the beginning and 427.3 MB in the end (delta: 107.0 MB). Free memory was 250.8 MB in the beginning and 315.3 MB in the end (delta: -64.5 MB). Peak memory consumption was 195.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 51699.69 ms. Allocated memory was 427.3 MB in the beginning and 814.7 MB in the end (delta: 387.4 MB). Free memory was 315.3 MB in the beginning and 606.8 MB in the end (delta: -291.5 MB). Peak memory consumption was 582.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2010 VarBasedMoverChecksPositive, 112 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 85 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.8s, 262 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 43.9s, 144 PlacesBefore, 49 PlacesAfterwards, 133 TransitionsBefore, 36 TransitionsAfterwards, 2924 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 9711 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p1_EBX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L714] 0 _Bool x$flush_delayed; [L715] 0 int x$mem_tmp; [L716] 0 _Bool x$r_buff0_thd0; [L717] 0 _Bool x$r_buff0_thd1; [L718] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd3; [L720] 0 _Bool x$r_buff0_thd4; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$r_buff1_thd4; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool z$flush_delayed; [L737] 0 int z$mem_tmp; [L738] 0 _Bool z$r_buff0_thd0; [L739] 0 _Bool z$r_buff0_thd1; [L740] 0 _Bool z$r_buff0_thd2; [L741] 0 _Bool z$r_buff0_thd3; [L742] 0 _Bool z$r_buff0_thd4; [L743] 0 _Bool z$r_buff1_thd0; [L744] 0 _Bool z$r_buff1_thd1; [L745] 0 _Bool z$r_buff1_thd2; [L746] 0 _Bool z$r_buff1_thd3; [L747] 0 _Bool z$r_buff1_thd4; [L748] 0 _Bool z$read_delayed; [L749] 0 int *z$read_delayed_var; [L750] 0 int z$w_buff0; [L751] 0 _Bool z$w_buff0_used; [L752] 0 int z$w_buff1; [L753] 0 _Bool z$w_buff1_used; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice2; [L909] 0 pthread_t t625; [L910] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L911] 0 pthread_t t626; [L912] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 2 x$w_buff1 = x$w_buff0 [L780] 2 x$w_buff0 = 2 [L781] 2 x$w_buff1_used = x$w_buff0_used [L782] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L784] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L785] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L786] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L787] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L788] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L789] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L913] 0 pthread_t t627; [L914] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L915] 0 pthread_t t628; [L916] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L850] 4 z$w_buff1 = z$w_buff0 [L851] 4 z$w_buff0 = 2 [L852] 4 z$w_buff1_used = z$w_buff0_used [L853] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L855] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L856] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L857] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L858] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L859] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L860] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L863] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L864] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L865] 4 z$flush_delayed = weak$$choice2 [L866] 4 z$mem_tmp = z [L867] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L867] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L868] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L868] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L868] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L868] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L869] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L869] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L869] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L870] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L870] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L870] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L870] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L870] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L871] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L871] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L872] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L872] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L872] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L872] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L872] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L873] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L873] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L873] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L874] 4 __unbuffered_p3_EAX = z [L875] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L875] 4 z = z$flush_delayed ? z$mem_tmp : z [L876] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 2 x$flush_delayed = weak$$choice2 [L795] 2 x$mem_tmp = x [L796] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L796] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L797] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L797] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0 [L797] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L797] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L797] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L798] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L798] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L798] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L799] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L800] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L800] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L801] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L802] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L879] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L765] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L765] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L768] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L769] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L808] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=11, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=11, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] 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) [L836] 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) [L837] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L838] 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 [L839] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L840] 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 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L882] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L882] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L882] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L882] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L883] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L883] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L884] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L884] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L885] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L885] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L886] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L886] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L887] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L887] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L888] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L888] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L889] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L889] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L890] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L890] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L891] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L891] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L894] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L896] 4 return 0; [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L918] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L935] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L936] 0 z$flush_delayed = weak$$choice2 [L937] 0 z$mem_tmp = z [L938] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L938] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L939] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L939] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L940] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L940] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L941] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L941] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L941] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L941] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L942] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L942] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L942] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L942] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L943] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L943] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L944] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L944] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 x$flush_delayed = weak$$choice2 [L948] 0 x$mem_tmp = x [L949] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L949] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L949] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L949] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L950] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L950] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L950] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L950] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L951] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L951] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L952] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L952] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L952] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L952] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L952] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L952] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L953] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L953] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L953] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L953] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L953] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L954] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L954] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L954] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L955] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L955] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L955] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L957] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L957] 0 z = z$flush_delayed ? z$mem_tmp : z [L958] 0 z$flush_delayed = (_Bool)0 [L959] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=10, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 51.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.4s, HoareTripleCheckerStatistics: 417 SDtfs, 512 SDslu, 597 SDs, 0 SdLazy, 229 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6557occurred 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: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 12009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...