/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/mix021_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:45:34,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:45:34,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:45:34,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:45:34,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:45:34,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:45:34,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:45:34,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:45:34,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:45:34,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:45:34,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:45:34,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:45:34,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:45:34,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:45:34,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:45:34,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:45:34,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:45:34,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:45:34,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:45:34,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:45:34,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:45:34,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:45:34,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:45:34,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:45:34,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:45:34,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:45:34,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:45:34,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:45:34,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:45:34,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:45:34,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:45:34,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:45:34,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:45:34,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:45:34,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:45:34,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:45:34,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:45:34,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:45:34,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:45:34,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:45:34,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:45:34,554 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:45:34,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:45:34,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:45:34,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:45:34,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:45:34,584 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:45:34,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:45:34,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:45:34,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:45:34,586 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:45:34,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:45:34,586 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:45:34,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:45:34,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:45:34,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:45:34,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:45:34,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:45:34,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:45:34,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:45:34,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:45:34,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:45:34,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:45:34,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:45:34,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:45:34,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:45:34,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:45:34,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:45:34,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:45:34,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:45:34,917 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:45:34,917 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:45:34,918 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.opt.i [2020-10-11 14:45:34,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2e62819/04dd18bed79f4bc992356ced0f65adda/FLAGadf7bbd37 [2020-10-11 14:45:35,578 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:45:35,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.opt.i [2020-10-11 14:45:35,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2e62819/04dd18bed79f4bc992356ced0f65adda/FLAGadf7bbd37 [2020-10-11 14:45:35,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce2e62819/04dd18bed79f4bc992356ced0f65adda [2020-10-11 14:45:35,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:45:35,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:45:35,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:45:35,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:45:35,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:45:35,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:45:35" (1/1) ... [2020-10-11 14:45:35,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8dedae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:35, skipping insertion in model container [2020-10-11 14:45:35,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:45:35" (1/1) ... [2020-10-11 14:45:35,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:45:35,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:45:36,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:45:36,488 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:45:36,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:45:36,649 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:45:36,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36 WrapperNode [2020-10-11 14:45:36,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:45:36,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:45:36,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:45:36,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:45:36,662 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:45:36" (1/1) ... [2020-10-11 14:45:36,688 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:45:36" (1/1) ... [2020-10-11 14:45:36,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:45:36,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:45:36,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:45:36,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:45:36,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (1/1) ... [2020-10-11 14:45:36,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:45:36,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:45:36,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:45:36,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:45:36,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (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:45:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:45:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:45:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:45:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:45:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:45:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:45:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:45:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:45:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:45:36,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:45:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 14:45:36,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 14:45:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:45:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:45:36,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:45:36,872 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:45:39,223 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:45:39,224 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:45:39,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:45:39 BoogieIcfgContainer [2020-10-11 14:45:39,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:45:39,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:45:39,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:45:39,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:45:39,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:45:35" (1/3) ... [2020-10-11 14:45:39,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f7a3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:45:39, skipping insertion in model container [2020-10-11 14:45:39,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:36" (2/3) ... [2020-10-11 14:45:39,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f7a3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:45:39, skipping insertion in model container [2020-10-11 14:45:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:45:39" (3/3) ... [2020-10-11 14:45:39,234 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.opt.i [2020-10-11 14:45:39,248 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:45:39,248 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:45:39,257 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:45:39,258 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:45:39,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,294 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,297 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,307 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,323 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,324 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,333 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,336 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,337 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,346 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:45:39,362 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 14:45:39,386 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:45:39,386 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:45:39,386 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:45:39,386 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:45:39,386 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:45:39,387 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:45:39,387 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:45:39,387 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:45:39,401 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:45:39,404 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 238 flow [2020-10-11 14:45:39,407 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 238 flow [2020-10-11 14:45:39,409 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 238 flow [2020-10-11 14:45:39,458 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-11 14:45:39,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:45:39,463 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-11 14:45:39,467 INFO L117 LiptonReduction]: Number of co-enabled transitions 2340 [2020-10-11 14:45:39,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:39,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:39,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:39,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:39,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:39,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:39,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:39,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:39,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:39,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:39,657 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:45:39,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:39,660 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:45:39,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:39,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:39,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:39,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:39,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,087 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-11 14:45:40,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:40,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:40,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,220 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:45:40,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,223 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:45:40,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:40,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:40,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:40,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:40,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,407 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:45:40,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,409 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:45:40,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:40,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:40,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:40,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,688 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:45:40,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,689 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:45:40,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:40,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:40,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:40,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,830 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:45:40,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:40,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:40,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:40,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:40,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:41,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:45:41,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:41,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:45:41,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:41,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:41,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:41,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:41,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:41,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:41,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:41,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:41,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:41,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:41,364 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:45:41,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:41,366 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:45:41,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:41,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:41,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:41,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:41,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:41,890 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-11 14:45:42,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,057 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:45:42,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,059 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:45:42,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:45:42,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,167 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:45:42,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,169 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:45:42,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:45:42,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:42,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:42,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:42,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:42,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:45:42,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,538 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:45:42,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,539 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:45:42,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:45:42,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:45:42,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:45:42,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:45:42,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,614 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:45:42,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,616 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:45:42,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:42,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:42,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:45:42,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:42,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:45:42,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:45:42,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:42,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:45:42,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:45:43,569 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-11 14:45:43,693 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-11 14:45:43,816 INFO L132 LiptonReduction]: Checked pairs total: 6385 [2020-10-11 14:45:43,817 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-11 14:45:43,824 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2020-10-11 14:45:43,987 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2410 states. [2020-10-11 14:45:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states. [2020-10-11 14:45:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 14:45:43,997 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:43,998 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:43,998 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_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:45:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2054672627, now seen corresponding path program 1 times [2020-10-11 14:45:44,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:44,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533206452] [2020-10-11 14:45:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:44,309 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:45:44,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533206452] [2020-10-11 14:45:44,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:44,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:45:44,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100699949] [2020-10-11 14:45:44,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:44,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:44,335 INFO L87 Difference]: Start difference. First operand 2410 states. Second operand 3 states. [2020-10-11 14:45:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:44,461 INFO L93 Difference]: Finished difference Result 2090 states and 7968 transitions. [2020-10-11 14:45:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:44,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 14:45:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:44,514 INFO L225 Difference]: With dead ends: 2090 [2020-10-11 14:45:44,515 INFO L226 Difference]: Without dead ends: 1706 [2020-10-11 14:45:44,516 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:45:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-10-11 14:45:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2020-10-11 14:45:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-10-11 14:45:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2020-10-11 14:45:44,690 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2020-10-11 14:45:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:44,692 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2020-10-11 14:45:44,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2020-10-11 14:45:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 14:45:44,694 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:44,695 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:44,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:45:44,695 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_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:45:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1144625748, now seen corresponding path program 1 times [2020-10-11 14:45:44,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:44,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522947728] [2020-10-11 14:45:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:44,771 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:45:44,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522947728] [2020-10-11 14:45:44,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:44,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:45:44,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49701556] [2020-10-11 14:45:44,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:44,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:44,774 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand 3 states. [2020-10-11 14:45:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:44,821 INFO L93 Difference]: Finished difference Result 1578 states and 5856 transitions. [2020-10-11 14:45:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:44,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-11 14:45:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:44,836 INFO L225 Difference]: With dead ends: 1578 [2020-10-11 14:45:44,836 INFO L226 Difference]: Without dead ends: 1578 [2020-10-11 14:45:44,837 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:45:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2020-10-11 14:45:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2020-10-11 14:45:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-10-11 14:45:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5856 transitions. [2020-10-11 14:45:44,920 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 5856 transitions. Word has length 11 [2020-10-11 14:45:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:44,920 INFO L481 AbstractCegarLoop]: Abstraction has 1578 states and 5856 transitions. [2020-10-11 14:45:44,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 5856 transitions. [2020-10-11 14:45:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:45:44,924 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:44,924 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:44,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:45:44,924 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_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:45:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash 473696022, now seen corresponding path program 1 times [2020-10-11 14:45:44,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:44,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129100924] [2020-10-11 14:45:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:45,030 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:45:45,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129100924] [2020-10-11 14:45:45,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:45,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:45:45,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287978018] [2020-10-11 14:45:45,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:45,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:45,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:45,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:45,033 INFO L87 Difference]: Start difference. First operand 1578 states and 5856 transitions. Second operand 3 states. [2020-10-11 14:45:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:45,065 INFO L93 Difference]: Finished difference Result 1546 states and 5712 transitions. [2020-10-11 14:45:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:45,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-11 14:45:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:45,136 INFO L225 Difference]: With dead ends: 1546 [2020-10-11 14:45:45,137 INFO L226 Difference]: Without dead ends: 1546 [2020-10-11 14:45:45,137 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:45:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-10-11 14:45:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2020-10-11 14:45:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-10-11 14:45:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5712 transitions. [2020-10-11 14:45:45,190 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5712 transitions. Word has length 13 [2020-10-11 14:45:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:45,190 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 5712 transitions. [2020-10-11 14:45:45,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5712 transitions. [2020-10-11 14:45:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:45:45,193 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:45,193 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:45,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:45:45,193 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_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:45:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1799674759, now seen corresponding path program 1 times [2020-10-11 14:45:45,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:45,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782146931] [2020-10-11 14:45:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:45,321 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:45:45,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782146931] [2020-10-11 14:45:45,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:45,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:45:45,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123086057] [2020-10-11 14:45:45,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:45,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:45,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:45,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:45,326 INFO L87 Difference]: Start difference. First operand 1546 states and 5712 transitions. Second operand 3 states. [2020-10-11 14:45:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:45,353 INFO L93 Difference]: Finished difference Result 1522 states and 5606 transitions. [2020-10-11 14:45:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-11 14:45:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:45,368 INFO L225 Difference]: With dead ends: 1522 [2020-10-11 14:45:45,368 INFO L226 Difference]: Without dead ends: 1522 [2020-10-11 14:45:45,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:45:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-10-11 14:45:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2020-10-11 14:45:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2020-10-11 14:45:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 5606 transitions. [2020-10-11 14:45:45,420 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 5606 transitions. Word has length 14 [2020-10-11 14:45:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:45,420 INFO L481 AbstractCegarLoop]: Abstraction has 1522 states and 5606 transitions. [2020-10-11 14:45:45,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 5606 transitions. [2020-10-11 14:45:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:45:45,422 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:45,423 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:45,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:45:45,423 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_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:45:45,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash -44619968, now seen corresponding path program 1 times [2020-10-11 14:45:45,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:45,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727656436] [2020-10-11 14:45:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:45,511 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:45:45,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727656436] [2020-10-11 14:45:45,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:45,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:45:45,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250291158] [2020-10-11 14:45:45,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:45,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:45,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:45,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:45,514 INFO L87 Difference]: Start difference. First operand 1522 states and 5606 transitions. Second operand 3 states. [2020-10-11 14:45:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:45,555 INFO L93 Difference]: Finished difference Result 2066 states and 7350 transitions. [2020-10-11 14:45:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:45,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-11 14:45:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:45,570 INFO L225 Difference]: With dead ends: 2066 [2020-10-11 14:45:45,570 INFO L226 Difference]: Without dead ends: 1586 [2020-10-11 14:45:45,571 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:45:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2020-10-11 14:45:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1490. [2020-10-11 14:45:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-10-11 14:45:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 5238 transitions. [2020-10-11 14:45:45,624 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 5238 transitions. Word has length 15 [2020-10-11 14:45:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:45,624 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 5238 transitions. [2020-10-11 14:45:45,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 5238 transitions. [2020-10-11 14:45:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:45:45,627 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:45,627 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:45,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:45:45,627 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_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:45:45,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:45,628 INFO L82 PathProgramCache]: Analyzing trace with hash -44617953, now seen corresponding path program 1 times [2020-10-11 14:45:45,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:45,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513793869] [2020-10-11 14:45:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:45,718 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:45:45,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513793869] [2020-10-11 14:45:45,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:45,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:45:45,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172568984] [2020-10-11 14:45:45,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:45:45,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:45,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:45:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:45:45,720 INFO L87 Difference]: Start difference. First operand 1490 states and 5238 transitions. Second operand 4 states. [2020-10-11 14:45:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:45,774 INFO L93 Difference]: Finished difference Result 1562 states and 4985 transitions. [2020-10-11 14:45:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:45:45,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-11 14:45:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:45,784 INFO L225 Difference]: With dead ends: 1562 [2020-10-11 14:45:45,784 INFO L226 Difference]: Without dead ends: 1178 [2020-10-11 14:45:45,785 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:45:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-10-11 14:45:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2020-10-11 14:45:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2020-10-11 14:45:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 3738 transitions. [2020-10-11 14:45:45,826 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 3738 transitions. Word has length 15 [2020-10-11 14:45:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:45,826 INFO L481 AbstractCegarLoop]: Abstraction has 1178 states and 3738 transitions. [2020-10-11 14:45:45,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:45:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 3738 transitions. [2020-10-11 14:45:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 14:45:45,830 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:45,830 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:45,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:45:45,830 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_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:45:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1863583824, now seen corresponding path program 1 times [2020-10-11 14:45:45,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:45,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369279871] [2020-10-11 14:45:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:45,921 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:45:45,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369279871] [2020-10-11 14:45:45,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:45,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:45:45,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441441869] [2020-10-11 14:45:45,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:45:45,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:45,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:45:45,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:45:45,924 INFO L87 Difference]: Start difference. First operand 1178 states and 3738 transitions. Second operand 5 states. [2020-10-11 14:45:45,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:45,981 INFO L93 Difference]: Finished difference Result 1032 states and 2984 transitions. [2020-10-11 14:45:45,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:45:45,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-11 14:45:45,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:45,987 INFO L225 Difference]: With dead ends: 1032 [2020-10-11 14:45:45,987 INFO L226 Difference]: Without dead ends: 783 [2020-10-11 14:45:45,988 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:45:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-10-11 14:45:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2020-10-11 14:45:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-10-11 14:45:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 2220 transitions. [2020-10-11 14:45:46,010 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 2220 transitions. Word has length 17 [2020-10-11 14:45:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:46,011 INFO L481 AbstractCegarLoop]: Abstraction has 783 states and 2220 transitions. [2020-10-11 14:45:46,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:45:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 2220 transitions. [2020-10-11 14:45:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:45:46,013 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:46,013 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:45:46,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:45:46,014 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_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:45:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2059360479, now seen corresponding path program 1 times [2020-10-11 14:45:46,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:46,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861110239] [2020-10-11 14:45:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:46,154 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:45:46,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861110239] [2020-10-11 14:45:46,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:46,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:45:46,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022140352] [2020-10-11 14:45:46,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:45:46,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:45:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:45:46,156 INFO L87 Difference]: Start difference. First operand 783 states and 2220 transitions. Second operand 6 states. [2020-10-11 14:45:46,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:46,221 INFO L93 Difference]: Finished difference Result 683 states and 1898 transitions. [2020-10-11 14:45:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:45:46,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-11 14:45:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:46,225 INFO L225 Difference]: With dead ends: 683 [2020-10-11 14:45:46,225 INFO L226 Difference]: Without dead ends: 596 [2020-10-11 14:45:46,226 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:45:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-11 14:45:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2020-10-11 14:45:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-10-11 14:45:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1679 transitions. [2020-10-11 14:45:46,241 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1679 transitions. Word has length 19 [2020-10-11 14:45:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:46,242 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 1679 transitions. [2020-10-11 14:45:46,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:45:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1679 transitions. [2020-10-11 14:45:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 14:45:46,243 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:46,244 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] [2020-10-11 14:45:46,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:45:46,244 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_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:45:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1478902093, now seen corresponding path program 1 times [2020-10-11 14:45:46,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:46,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656587506] [2020-10-11 14:45:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:46,511 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:45:46,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656587506] [2020-10-11 14:45:46,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:46,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:45:46,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177600155] [2020-10-11 14:45:46,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:45:46,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:45:46,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:45:46,513 INFO L87 Difference]: Start difference. First operand 596 states and 1679 transitions. Second operand 7 states. [2020-10-11 14:45:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:46,724 INFO L93 Difference]: Finished difference Result 859 states and 2308 transitions. [2020-10-11 14:45:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 14:45:46,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 14:45:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:46,729 INFO L225 Difference]: With dead ends: 859 [2020-10-11 14:45:46,729 INFO L226 Difference]: Without dead ends: 761 [2020-10-11 14:45:46,730 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:45:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-11 14:45:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 580. [2020-10-11 14:45:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-10-11 14:45:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1594 transitions. [2020-10-11 14:45:46,748 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1594 transitions. Word has length 22 [2020-10-11 14:45:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:46,750 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 1594 transitions. [2020-10-11 14:45:46,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:45:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1594 transitions. [2020-10-11 14:45:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 14:45:46,754 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:46,755 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] [2020-10-11 14:45:46,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:45:46,755 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_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:45:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -376655693, now seen corresponding path program 2 times [2020-10-11 14:45:46,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:46,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989001156] [2020-10-11 14:45:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:46,911 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:45:46,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989001156] [2020-10-11 14:45:46,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:46,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:45:46,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916030953] [2020-10-11 14:45:46,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:45:46,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:45:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:45:46,913 INFO L87 Difference]: Start difference. First operand 580 states and 1594 transitions. Second operand 7 states. [2020-10-11 14:45:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:47,003 INFO L93 Difference]: Finished difference Result 556 states and 1545 transitions. [2020-10-11 14:45:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:45:47,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-11 14:45:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:47,007 INFO L225 Difference]: With dead ends: 556 [2020-10-11 14:45:47,007 INFO L226 Difference]: Without dead ends: 317 [2020-10-11 14:45:47,008 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:45:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-11 14:45:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2020-10-11 14:45:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-11 14:45:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 855 transitions. [2020-10-11 14:45:47,016 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 855 transitions. Word has length 22 [2020-10-11 14:45:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:47,017 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 855 transitions. [2020-10-11 14:45:47,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:45:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 855 transitions. [2020-10-11 14:45:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 14:45:47,018 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:47,018 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:45:47,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:45:47,019 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_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:45:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1451364263, now seen corresponding path program 1 times [2020-10-11 14:45:47,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:47,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977296194] [2020-10-11 14:45:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:45:47,069 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:45:47,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977296194] [2020-10-11 14:45:47,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:45:47,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:45:47,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052682163] [2020-10-11 14:45:47,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:45:47,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:45:47,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:45:47,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:45:47,071 INFO L87 Difference]: Start difference. First operand 317 states and 855 transitions. Second operand 3 states. [2020-10-11 14:45:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:45:47,079 INFO L93 Difference]: Finished difference Result 455 states and 1199 transitions. [2020-10-11 14:45:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:45:47,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-10-11 14:45:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:45:47,081 INFO L225 Difference]: With dead ends: 455 [2020-10-11 14:45:47,082 INFO L226 Difference]: Without dead ends: 181 [2020-10-11 14:45:47,082 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:45:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-11 14:45:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-10-11 14:45:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-11 14:45:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 429 transitions. [2020-10-11 14:45:47,087 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 429 transitions. Word has length 25 [2020-10-11 14:45:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:45:47,087 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 429 transitions. [2020-10-11 14:45:47,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:45:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 429 transitions. [2020-10-11 14:45:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-11 14:45:47,088 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:45:47,089 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:45:47,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:45:47,089 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_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:45:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:45:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 661728957, now seen corresponding path program 2 times [2020-10-11 14:45:47,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:45:47,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932061447] [2020-10-11 14:45:47,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:45:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:45:47,186 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:45:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:45:47,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:45:47,273 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:45:47,273 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:45:47,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:45:47,275 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 14:45:47,293 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1193] [1193] L2-->L869: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In-99847256 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-99847256 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-99847256 256) 0)) (.cse9 (= 0 (mod ~z$r_buff1_thd0~0_In-99847256 256)))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out-99847256 0) .cse1) (and (= ~z$w_buff1_used~0_Out-99847256 ~z$w_buff1_used~0_In-99847256) .cse2)) (= ~z$r_buff0_thd0~0_Out-99847256 ~z$r_buff0_thd0~0_In-99847256) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-99847256 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-99847256| ULTIMATE.start_assume_abort_if_not_~cond_Out-99847256) (or (and (= ~z~0_Out-99847256 ~z$w_buff0~0_In-99847256) .cse3 .cse4) (and (or (and .cse0 .cse1 (= ~z~0_Out-99847256 ~z$w_buff1~0_In-99847256)) (and (= ~z~0_Out-99847256 ~z~0_In-99847256) .cse2)) .cse5)) (= ~z$r_buff1_thd0~0_Out-99847256 ~z$r_buff1_thd0~0_In-99847256) (or (and (= ~z$w_buff0_used~0_In-99847256 ~z$w_buff0_used~0_Out-99847256) .cse5) (and (= ~z$w_buff0_used~0_Out-99847256 0) .cse3 .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-99847256|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-99847256, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-99847256, ~z$w_buff0~0=~z$w_buff0~0_In-99847256, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-99847256, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-99847256, ~z$w_buff1~0=~z$w_buff1~0_In-99847256, ~z~0=~z~0_In-99847256} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-99847256, ~z$w_buff0~0=~z$w_buff0~0_In-99847256, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-99847256, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-99847256|, ~z$w_buff1~0=~z$w_buff1~0_In-99847256, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-99847256|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-99847256|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-99847256|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-99847256|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-99847256, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-99847256|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-99847256|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-99847256, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-99847256, ~z~0=~z~0_Out-99847256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2020-10-11 14:45:47,301 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:45:47,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,301 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:45:47,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,302 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:45:47,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,302 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:45:47,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,303 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:45:47,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,303 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:45:47,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,303 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:45:47,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,304 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:45:47,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,304 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:45:47,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,304 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:45:47,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,305 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:45:47,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,305 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:45:47,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,305 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:45:47,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,307 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:45:47,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,307 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:45:47,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,308 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:45:47,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,308 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:45:47,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,308 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:45:47,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,309 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:45:47,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,309 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:45:47,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,309 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:45:47,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,310 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:45:47,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,310 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:45:47,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,310 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:45:47,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,311 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:45:47,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,311 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:45:47,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,311 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:45:47,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,312 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:45:47,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,313 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:45:47,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,313 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:45:47,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,313 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:45:47,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,314 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:45:47,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,314 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:45:47,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,314 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:45:47,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:45:47,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:45:47 BasicIcfg [2020-10-11 14:45:47,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:45:47,394 INFO L168 Benchmark]: Toolchain (without parser) took 11515.20 ms. Allocated memory was 249.0 MB in the beginning and 623.4 MB in the end (delta: 374.3 MB). Free memory was 203.5 MB in the beginning and 518.3 MB in the end (delta: -314.8 MB). Peak memory consumption was 59.6 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,394 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 249.0 MB. Free memory was 227.1 MB in the beginning and 226.3 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.74 ms. Allocated memory was 249.0 MB in the beginning and 307.2 MB in the end (delta: 58.2 MB). Free memory was 203.5 MB in the beginning and 256.3 MB in the end (delta: -52.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,397 INFO L168 Benchmark]: Boogie Preprocessor took 67.49 ms. Allocated memory is still 307.2 MB. Free memory was 253.7 MB in the beginning and 250.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,400 INFO L168 Benchmark]: RCFGBuilder took 2432.04 ms. Allocated memory was 307.2 MB in the beginning and 368.6 MB in the end (delta: 61.3 MB). Free memory was 250.4 MB in the beginning and 312.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 148.6 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,402 INFO L168 Benchmark]: TraceAbstraction took 8160.79 ms. Allocated memory was 368.6 MB in the beginning and 623.4 MB in the end (delta: 254.8 MB). Free memory was 312.9 MB in the beginning and 518.3 MB in the end (delta: -205.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:45:47,407 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.22 ms. Allocated memory is still 249.0 MB. Free memory was 227.1 MB in the beginning and 226.3 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 772.74 ms. Allocated memory was 249.0 MB in the beginning and 307.2 MB in the end (delta: 58.2 MB). Free memory was 203.5 MB in the beginning and 256.3 MB in the end (delta: -52.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 307.2 MB. Free memory was 256.3 MB in the beginning and 253.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 67.49 ms. Allocated memory is still 307.2 MB. Free memory was 253.7 MB in the beginning and 250.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2432.04 ms. Allocated memory was 307.2 MB in the beginning and 368.6 MB in the end (delta: 61.3 MB). Free memory was 250.4 MB in the beginning and 312.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 148.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8160.79 ms. Allocated memory was 368.6 MB in the beginning and 623.4 MB in the end (delta: 254.8 MB). Free memory was 312.9 MB in the beginning and 518.3 MB in the end (delta: -205.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1617 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 220 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.4s, 120 PlacesBefore, 44 PlacesAfterwards, 109 TransitionsBefore, 32 TransitionsAfterwards, 2340 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 6385 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_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L851] 0 pthread_t t581; [L852] FCALL, FORK 0 pthread_create(&t581, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, 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] [L853] 0 pthread_t t582; [L854] FCALL, FORK 0 pthread_create(&t582, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, 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] [L855] 0 pthread_t t583; [L856] FCALL, FORK 0 pthread_create(&t583, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L857] 0 pthread_t t584; [L858] FCALL, FORK 0 pthread_create(&t584, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L797] 4 z$w_buff1 = z$w_buff0 [L798] 4 z$w_buff0 = 1 [L799] 4 z$w_buff1_used = z$w_buff0_used [L800] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L802] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L803] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L804] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L805] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L806] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L807] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 4 z$flush_delayed = weak$$choice2 [L813] 4 z$mem_tmp = z [L814] 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) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L814] 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) [L814] 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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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)) [L819] 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)) [L819] 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)) [L820] 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)) [L820] 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) [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L820] 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) [L820] 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)) [L820] 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)) [L821] 4 __unbuffered_p3_EAX = z [L822] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L822] 4 z = z$flush_delayed ? z$mem_tmp : z [L823] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=9, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 3 z$flush_delayed = weak$$choice2 [L775] 3 z$mem_tmp = z [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L777] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L777] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L778] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L779] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L779] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L780] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L782] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L782] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 __unbuffered_p2_EAX = z [L784] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L784] 3 z = z$flush_delayed ? z$mem_tmp : z [L785] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 3 return 0; [L829] 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) [L829] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L829] 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) [L829] 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) [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L831] 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 [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L832] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 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 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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, y=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 344 SDtfs, 372 SDslu, 582 SDs, 0 SdLazy, 239 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 277 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...