/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:06:08,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:06:08,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:06:08,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:06:08,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:06:08,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:06:08,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:06:08,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:06:08,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:06:08,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:06:08,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:06:08,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:06:08,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:06:08,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:06:08,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:06:08,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:06:08,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:06:08,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:06:08,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:06:08,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:06:08,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:06:08,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:06:08,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:06:08,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:06:08,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:06:08,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:06:08,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:06:08,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:06:08,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:06:08,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:06:08,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:06:08,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:06:08,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:06:08,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:06:08,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:06:08,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:06:08,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:06:08,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:06:08,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:06:08,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:06:08,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:06:08,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:06:08,378 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:06:08,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:06:08,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:06:08,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:06:08,380 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:06:08,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:06:08,381 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:06:08,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:06:08,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:06:08,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:06:08,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:06:08,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:06:08,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:06:08,383 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:06:08,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:06:08,384 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:06:08,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:06:08,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:06:08,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:06:08,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:06:08,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:06:08,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:06:08,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:06:08,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:06:08,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:06:08,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:06:08,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:06:08,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:06:08,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:06:08,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:06:08,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:06:08,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:06:08,693 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:06:08,694 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:06:08,694 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-16 05:06:08,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee04d2f44/145e945a412546a2b87ec51b49be12e4/FLAG729014a06 [2020-10-16 05:06:09,286 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:06:09,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.opt.i [2020-10-16 05:06:09,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee04d2f44/145e945a412546a2b87ec51b49be12e4/FLAG729014a06 [2020-10-16 05:06:09,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee04d2f44/145e945a412546a2b87ec51b49be12e4 [2020-10-16 05:06:09,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:06:09,626 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:06:09,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:06:09,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:06:09,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:06:09,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:06:09" (1/1) ... [2020-10-16 05:06:09,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b05ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:09, skipping insertion in model container [2020-10-16 05:06:09,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:06:09" (1/1) ... [2020-10-16 05:06:09,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:06:09,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:06:10,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:06:10,290 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:06:10,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:06:10,460 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:06:10,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10 WrapperNode [2020-10-16 05:06:10,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:06:10,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:06:10,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:06:10,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:06:10,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,494 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:06:10,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:06:10,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:06:10,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:06:10,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (1/1) ... [2020-10-16 05:06:10,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:06:10,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:06:10,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:06:10,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:06:10,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (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-16 05:06:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 05:06:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:06:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:06:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:06:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:06:10,676 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:06:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:06:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:06:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:06:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:06:10,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:06:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 05:06:10,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 05:06:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 05:06:10,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:06:10,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:06:10,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:06:10,684 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:06:14,380 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:06:14,380 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:06:14,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:06:14 BoogieIcfgContainer [2020-10-16 05:06:14,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:06:14,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:06:14,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:06:14,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:06:14,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:06:09" (1/3) ... [2020-10-16 05:06:14,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a6f851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:06:14, skipping insertion in model container [2020-10-16 05:06:14,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:10" (2/3) ... [2020-10-16 05:06:14,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a6f851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:06:14, skipping insertion in model container [2020-10-16 05:06:14,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:06:14" (3/3) ... [2020-10-16 05:06:14,397 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_power.opt.i [2020-10-16 05:06:14,410 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:06:14,421 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:06:14,422 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:06:14,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,530 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,531 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,532 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,533 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite98| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,540 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,541 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,541 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,565 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:14,588 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 05:06:14,611 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:06:14,611 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:06:14,611 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:06:14,611 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:06:14,612 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:06:14,612 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:06:14,612 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:06:14,612 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:06:14,627 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2020-10-16 05:06:14,689 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2020-10-16 05:06:14,690 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:14,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-16 05:06:14,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2020-10-16 05:06:14,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2020-10-16 05:06:14,723 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:06:14,726 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2020-10-16 05:06:14,729 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2020-10-16 05:06:14,730 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2020-10-16 05:06:14,760 INFO L129 PetriNetUnfolder]: 2/122 cut-off events. [2020-10-16 05:06:14,760 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:14,761 INFO L80 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-16 05:06:14,765 INFO L117 LiptonReduction]: Number of co-enabled transitions 2274 [2020-10-16 05:06:15,214 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 05:06:15,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:15,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:15,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:15,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:15,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:15,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:15,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:15,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:15,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:15,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:15,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:15,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:15,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:15,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:15,554 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-16 05:06:15,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:15,559 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-16 05:06:15,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:15,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:15,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:15,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:15,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:15,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:15,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:15,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:15,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:15,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,445 WARN L193 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 406 DAG size of output: 363 [2020-10-16 05:06:20,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:20,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:20,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-16 05:06:20,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-16 05:06:20,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 2, 1] term [2020-10-16 05:06:20,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:20,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:20,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,805 WARN L193 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 197 DAG size of output: 172 [2020-10-16 05:06:22,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:22,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:22,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:22,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:22,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:22,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:22,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:22,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:22,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:22,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:22,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:22,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:22,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:22,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:22,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:22,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:22,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:22,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:22,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:22,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:22,969 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-16 05:06:22,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:22,971 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-16 05:06:22,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:23,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:23,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:23,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,151 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-16 05:06:23,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,153 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-16 05:06:23,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:23,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:23,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:23,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:23,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,652 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-16 05:06:23,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,653 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-16 05:06:23,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:23,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:23,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:23,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:23,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 05:06:23,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 05:06:23,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-16 05:06:23,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:06:23,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:06:23,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:06:23,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:23,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:23,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:23,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:23,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:23,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:23,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:24,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,047 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-16 05:06:24,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,051 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-16 05:06:24,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:24,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:24,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:24,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:24,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,399 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-16 05:06:24,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,402 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-16 05:06:24,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:24,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:06:24,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:24,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:24,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:24,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:06:24,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:24,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 4, 2, 1] term [2020-10-16 05:06:24,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:24,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:24,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:24,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:24,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,303 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-16 05:06:25,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:25,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:25,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,465 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 05:06:25,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:25,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:25,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:25,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:25,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:25,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,059 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 05:06:26,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:26,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:26,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:26,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:26,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,059 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-10-16 05:06:27,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 05:06:27,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:27,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,652 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-16 05:06:27,773 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-16 05:06:27,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:27,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:27,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:27,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,447 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 05:06:28,615 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 05:06:28,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:28,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:28,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:28,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:28,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:28,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:28,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:28,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:28,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:28,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:29,365 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 142 [2020-10-16 05:06:29,656 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-10-16 05:06:29,665 INFO L132 LiptonReduction]: Checked pairs total: 5446 [2020-10-16 05:06:29,665 INFO L134 LiptonReduction]: Total number of compositions: 107 [2020-10-16 05:06:29,670 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14950 [2020-10-16 05:06:29,681 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 05:06:29,681 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:29,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:29,682 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:06:29,683 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1760210776, now seen corresponding path program 1 times [2020-10-16 05:06:29,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:29,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902808374] [2020-10-16 05:06:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:29,933 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-16 05:06:29,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902808374] [2020-10-16 05:06:29,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:29,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:29,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768870455] [2020-10-16 05:06:29,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:29,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:29,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:29,965 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 233 [2020-10-16 05:06:29,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states. [2020-10-16 05:06:29,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:29,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 233 [2020-10-16 05:06:29,970 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:30,144 INFO L129 PetriNetUnfolder]: 133/287 cut-off events. [2020-10-16 05:06:30,144 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:30,146 INFO L80 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 287 events. 133/287 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1449 event pairs, 87 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 495. Up to 153 conditions per place. [2020-10-16 05:06:30,149 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 11 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2020-10-16 05:06:30,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 98 flow [2020-10-16 05:06:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2020-10-16 05:06:30,169 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.899856938483548 [2020-10-16 05:06:30,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:30,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:30,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:30,190 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:30,192 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 629 transitions. [2020-10-16 05:06:30,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 98 flow [2020-10-16 05:06:30,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 05:06:30,199 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 62 flow [2020-10-16 05:06:30,202 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2020-10-16 05:06:30,202 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2020-10-16 05:06:30,203 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2020-10-16 05:06:30,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:30,203 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:30,203 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:30,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:06:30,203 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -900431533, now seen corresponding path program 1 times [2020-10-16 05:06:30,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:30,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043857085] [2020-10-16 05:06:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:30,304 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-16 05:06:30,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043857085] [2020-10-16 05:06:30,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:30,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:30,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721789336] [2020-10-16 05:06:30,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:30,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:30,310 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 233 [2020-10-16 05:06:30,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states. [2020-10-16 05:06:30,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:30,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 233 [2020-10-16 05:06:30,311 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:30,343 INFO L129 PetriNetUnfolder]: 24/83 cut-off events. [2020-10-16 05:06:30,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:30,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 83 events. 24/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 272 event pairs, 5 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 133. Up to 42 conditions per place. [2020-10-16 05:06:30,345 INFO L132 encePairwiseOnDemand]: 229/233 looper letters, 5 selfloop transitions, 3 changer transitions 2/29 dead transitions. [2020-10-16 05:06:30,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 90 flow [2020-10-16 05:06:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2020-10-16 05:06:30,348 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.899856938483548 [2020-10-16 05:06:30,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:30,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 629 transitions. [2020-10-16 05:06:30,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:30,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:30,352 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:30,353 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 629 transitions. [2020-10-16 05:06:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 90 flow [2020-10-16 05:06:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:30,354 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 75 flow [2020-10-16 05:06:30,354 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2020-10-16 05:06:30,355 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2020-10-16 05:06:30,355 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 75 flow [2020-10-16 05:06:30,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:30,355 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:30,355 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:30,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:06:30,356 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2144819906, now seen corresponding path program 1 times [2020-10-16 05:06:30,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:30,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925941742] [2020-10-16 05:06:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:30,433 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-16 05:06:30,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925941742] [2020-10-16 05:06:30,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:30,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:30,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037418228] [2020-10-16 05:06:30,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:30,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:30,437 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 233 [2020-10-16 05:06:30,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 75 flow. Second operand 3 states. [2020-10-16 05:06:30,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:30,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 233 [2020-10-16 05:06:30,438 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:30,451 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2020-10-16 05:06:30,451 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 05:06:30,451 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 34 events. 3/34 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 2/35 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2020-10-16 05:06:30,452 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 05:06:30,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 81 flow [2020-10-16 05:06:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:30,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2020-10-16 05:06:30,455 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8984263233190272 [2020-10-16 05:06:30,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2020-10-16 05:06:30,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2020-10-16 05:06:30,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:30,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2020-10-16 05:06:30,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:30,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:30,458 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:30,458 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 75 flow. Second operand 3 states and 628 transitions. [2020-10-16 05:06:30,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 81 flow [2020-10-16 05:06:30,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:30,460 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 80 flow [2020-10-16 05:06:30,460 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2020-10-16 05:06:30,460 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2020-10-16 05:06:30,461 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 80 flow [2020-10-16 05:06:30,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:30,461 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:30,461 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:30,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:06:30,461 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2064907791, now seen corresponding path program 1 times [2020-10-16 05:06:30,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:30,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528602692] [2020-10-16 05:06:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:30,530 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-16 05:06:30,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528602692] [2020-10-16 05:06:30,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:30,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:30,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476618785] [2020-10-16 05:06:30,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:30,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:30,534 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 233 [2020-10-16 05:06:30,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states. [2020-10-16 05:06:30,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:30,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 233 [2020-10-16 05:06:30,535 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:30,553 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2020-10-16 05:06:30,553 INFO L130 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2020-10-16 05:06:30,553 INFO L80 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 34 events. 3/34 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2020-10-16 05:06:30,554 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 05:06:30,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 86 flow [2020-10-16 05:06:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2020-10-16 05:06:30,557 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8812589413447782 [2020-10-16 05:06:30,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2020-10-16 05:06:30,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2020-10-16 05:06:30,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:30,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2020-10-16 05:06:30,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:30,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:30,561 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:30,561 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 80 flow. Second operand 3 states and 616 transitions. [2020-10-16 05:06:30,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 86 flow [2020-10-16 05:06:30,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:30,562 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2020-10-16 05:06:30,563 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 05:06:30,563 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2020-10-16 05:06:30,563 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2020-10-16 05:06:30,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:30,563 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:30,563 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:30,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:06:30,564 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1610113317, now seen corresponding path program 1 times [2020-10-16 05:06:30,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:30,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848211516] [2020-10-16 05:06:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:30,644 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-16 05:06:30,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848211516] [2020-10-16 05:06:30,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:30,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:06:30,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619800589] [2020-10-16 05:06:30,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:30,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:30,649 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 233 [2020-10-16 05:06:30,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand 3 states. [2020-10-16 05:06:30,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:30,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 233 [2020-10-16 05:06:30,650 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:30,678 INFO L129 PetriNetUnfolder]: 4/50 cut-off events. [2020-10-16 05:06:30,678 INFO L130 PetriNetUnfolder]: For 30/49 co-relation queries the response was YES. [2020-10-16 05:06:30,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 50 events. 4/50 cut-off events. For 30/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 2 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 92. Up to 12 conditions per place. [2020-10-16 05:06:30,679 INFO L132 encePairwiseOnDemand]: 230/233 looper letters, 5 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 05:06:30,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 103 flow [2020-10-16 05:06:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2020-10-16 05:06:30,682 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8955650929899857 [2020-10-16 05:06:30,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2020-10-16 05:06:30,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2020-10-16 05:06:30,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:30,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2020-10-16 05:06:30,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:30,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:30,686 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:30,686 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 3 states and 626 transitions. [2020-10-16 05:06:30,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 103 flow [2020-10-16 05:06:30,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 99 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:30,688 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 91 flow [2020-10-16 05:06:30,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2020-10-16 05:06:30,688 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2020-10-16 05:06:30,688 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 91 flow [2020-10-16 05:06:30,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:30,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:30,689 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:30,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:06:30,689 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash 368200555, now seen corresponding path program 1 times [2020-10-16 05:06:30,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:30,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637292483] [2020-10-16 05:06:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:31,064 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-16 05:06:31,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637292483] [2020-10-16 05:06:31,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:31,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:31,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153518926] [2020-10-16 05:06:31,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:31,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:31,070 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 233 [2020-10-16 05:06:31,070 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 91 flow. Second operand 7 states. [2020-10-16 05:06:31,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:31,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 233 [2020-10-16 05:06:31,071 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:31,540 INFO L129 PetriNetUnfolder]: 383/768 cut-off events. [2020-10-16 05:06:31,540 INFO L130 PetriNetUnfolder]: For 526/560 co-relation queries the response was YES. [2020-10-16 05:06:31,544 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 768 events. 383/768 cut-off events. For 526/560 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4276 event pairs, 156 based on Foata normal form. 8/753 useless extension candidates. Maximal degree in co-relation 1691. Up to 533 conditions per place. [2020-10-16 05:06:31,549 INFO L132 encePairwiseOnDemand]: 223/233 looper letters, 18 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2020-10-16 05:06:31,549 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 208 flow [2020-10-16 05:06:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2020-10-16 05:06:31,552 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6609442060085837 [2020-10-16 05:06:31,553 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2020-10-16 05:06:31,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2020-10-16 05:06:31,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:31,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2020-10-16 05:06:31,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:31,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:31,557 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:31,557 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 91 flow. Second operand 5 states and 770 transitions. [2020-10-16 05:06:31,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 208 flow [2020-10-16 05:06:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:31,561 INFO L241 Difference]: Finished difference. Result has 46 places, 40 transitions, 185 flow [2020-10-16 05:06:31,562 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2020-10-16 05:06:31,562 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2020-10-16 05:06:31,562 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 185 flow [2020-10-16 05:06:31,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:31,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:31,563 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:31,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:06:31,563 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1959241321, now seen corresponding path program 2 times [2020-10-16 05:06:31,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:31,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612520305] [2020-10-16 05:06:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:31,867 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-16 05:06:31,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612520305] [2020-10-16 05:06:31,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:31,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:31,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651305905] [2020-10-16 05:06:31,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:31,873 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 233 [2020-10-16 05:06:31,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 185 flow. Second operand 7 states. [2020-10-16 05:06:31,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:31,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 233 [2020-10-16 05:06:31,876 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:32,377 INFO L129 PetriNetUnfolder]: 386/775 cut-off events. [2020-10-16 05:06:32,378 INFO L130 PetriNetUnfolder]: For 1087/1153 co-relation queries the response was YES. [2020-10-16 05:06:32,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 775 events. 386/775 cut-off events. For 1087/1153 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4351 event pairs, 152 based on Foata normal form. 46/796 useless extension candidates. Maximal degree in co-relation 2369. Up to 530 conditions per place. [2020-10-16 05:06:32,387 INFO L132 encePairwiseOnDemand]: 225/233 looper letters, 21 selfloop transitions, 18 changer transitions 0/53 dead transitions. [2020-10-16 05:06:32,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 317 flow [2020-10-16 05:06:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2020-10-16 05:06:32,392 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6463519313304721 [2020-10-16 05:06:32,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2020-10-16 05:06:32,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2020-10-16 05:06:32,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:32,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2020-10-16 05:06:32,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:32,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:32,397 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:32,398 INFO L185 Difference]: Start difference. First operand has 46 places, 40 transitions, 185 flow. Second operand 5 states and 753 transitions. [2020-10-16 05:06:32,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 317 flow [2020-10-16 05:06:32,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:06:32,404 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 276 flow [2020-10-16 05:06:32,404 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2020-10-16 05:06:32,405 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2020-10-16 05:06:32,405 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 276 flow [2020-10-16 05:06:32,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:32,405 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:32,405 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:32,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:06:32,406 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1104221651, now seen corresponding path program 1 times [2020-10-16 05:06:32,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:32,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236503984] [2020-10-16 05:06:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:32,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-16 05:06:32,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236503984] [2020-10-16 05:06:32,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:32,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:06:32,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37329871] [2020-10-16 05:06:32,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:06:32,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:32,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:06:32,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:06:32,516 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 233 [2020-10-16 05:06:32,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 276 flow. Second operand 4 states. [2020-10-16 05:06:32,517 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:32,517 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 233 [2020-10-16 05:06:32,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:32,868 INFO L129 PetriNetUnfolder]: 579/1155 cut-off events. [2020-10-16 05:06:32,868 INFO L130 PetriNetUnfolder]: For 5193/6017 co-relation queries the response was YES. [2020-10-16 05:06:32,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 1155 events. 579/1155 cut-off events. For 5193/6017 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 7866 event pairs, 310 based on Foata normal form. 92/1031 useless extension candidates. Maximal degree in co-relation 3641. Up to 696 conditions per place. [2020-10-16 05:06:32,883 INFO L132 encePairwiseOnDemand]: 228/233 looper letters, 6 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2020-10-16 05:06:32,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 309 flow [2020-10-16 05:06:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:06:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:06:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 807 transitions. [2020-10-16 05:06:32,886 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8658798283261803 [2020-10-16 05:06:32,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 807 transitions. [2020-10-16 05:06:32,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 807 transitions. [2020-10-16 05:06:32,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:32,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 807 transitions. [2020-10-16 05:06:32,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:06:32,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:06:32,891 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:06:32,892 INFO L185 Difference]: Start difference. First operand has 52 places, 46 transitions, 276 flow. Second operand 4 states and 807 transitions. [2020-10-16 05:06:32,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 309 flow [2020-10-16 05:06:32,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:32,897 INFO L241 Difference]: Finished difference. Result has 55 places, 47 transitions, 279 flow [2020-10-16 05:06:32,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2020-10-16 05:06:32,897 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2020-10-16 05:06:32,898 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 279 flow [2020-10-16 05:06:32,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:06:32,898 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:32,898 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:32,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:06:32,898 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1158091070, now seen corresponding path program 1 times [2020-10-16 05:06:32,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:32,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756607363] [2020-10-16 05:06:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:32,993 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-16 05:06:32,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756607363] [2020-10-16 05:06:32,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:32,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:06:32,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232021879] [2020-10-16 05:06:32,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:06:32,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:06:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:06:32,996 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 233 [2020-10-16 05:06:32,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 279 flow. Second operand 4 states. [2020-10-16 05:06:32,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:32,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 233 [2020-10-16 05:06:32,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:33,656 INFO L129 PetriNetUnfolder]: 1740/3173 cut-off events. [2020-10-16 05:06:33,656 INFO L130 PetriNetUnfolder]: For 5660/6011 co-relation queries the response was YES. [2020-10-16 05:06:33,681 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8636 conditions, 3173 events. 1740/3173 cut-off events. For 5660/6011 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 24541 event pairs, 941 based on Foata normal form. 374/3198 useless extension candidates. Maximal degree in co-relation 8613. Up to 1746 conditions per place. [2020-10-16 05:06:33,695 INFO L132 encePairwiseOnDemand]: 226/233 looper letters, 11 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2020-10-16 05:06:33,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 347 flow [2020-10-16 05:06:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1002 transitions. [2020-10-16 05:06:33,699 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8600858369098713 [2020-10-16 05:06:33,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1002 transitions. [2020-10-16 05:06:33,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1002 transitions. [2020-10-16 05:06:33,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:33,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1002 transitions. [2020-10-16 05:06:33,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:33,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:33,705 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:33,705 INFO L185 Difference]: Start difference. First operand has 55 places, 47 transitions, 279 flow. Second operand 5 states and 1002 transitions. [2020-10-16 05:06:33,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 347 flow [2020-10-16 05:06:33,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:33,716 INFO L241 Difference]: Finished difference. Result has 60 places, 56 transitions, 353 flow [2020-10-16 05:06:33,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2020-10-16 05:06:33,717 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2020-10-16 05:06:33,717 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 353 flow [2020-10-16 05:06:33,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:06:33,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:33,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:33,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:06:33,718 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:33,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1914824800, now seen corresponding path program 1 times [2020-10-16 05:06:33,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:33,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852421563] [2020-10-16 05:06:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:33,769 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-16 05:06:33,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852421563] [2020-10-16 05:06:33,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:33,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:06:33,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257605469] [2020-10-16 05:06:33,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:06:33,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:06:33,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:06:33,772 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 233 [2020-10-16 05:06:33,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 353 flow. Second operand 4 states. [2020-10-16 05:06:33,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:33,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 233 [2020-10-16 05:06:33,773 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:34,456 INFO L129 PetriNetUnfolder]: 2371/4297 cut-off events. [2020-10-16 05:06:34,456 INFO L130 PetriNetUnfolder]: For 14327/16007 co-relation queries the response was YES. [2020-10-16 05:06:34,480 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14128 conditions, 4297 events. 2371/4297 cut-off events. For 14327/16007 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 34934 event pairs, 1246 based on Foata normal form. 291/4070 useless extension candidates. Maximal degree in co-relation 14102. Up to 2575 conditions per place. [2020-10-16 05:06:34,496 INFO L132 encePairwiseOnDemand]: 229/233 looper letters, 5 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2020-10-16 05:06:34,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 382 flow [2020-10-16 05:06:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1004 transitions. [2020-10-16 05:06:34,500 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8618025751072962 [2020-10-16 05:06:34,500 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1004 transitions. [2020-10-16 05:06:34,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1004 transitions. [2020-10-16 05:06:34,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:34,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1004 transitions. [2020-10-16 05:06:34,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:34,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:34,505 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:34,505 INFO L185 Difference]: Start difference. First operand has 60 places, 56 transitions, 353 flow. Second operand 5 states and 1004 transitions. [2020-10-16 05:06:34,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 382 flow [2020-10-16 05:06:34,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:34,520 INFO L241 Difference]: Finished difference. Result has 65 places, 58 transitions, 376 flow [2020-10-16 05:06:34,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2020-10-16 05:06:34,521 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2020-10-16 05:06:34,521 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 376 flow [2020-10-16 05:06:34,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:06:34,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:34,521 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:34,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:06:34,521 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash 477466275, now seen corresponding path program 1 times [2020-10-16 05:06:34,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:34,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904261328] [2020-10-16 05:06:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:34,634 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-16 05:06:34,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904261328] [2020-10-16 05:06:34,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:34,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:06:34,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528568087] [2020-10-16 05:06:34,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:06:34,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:06:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:06:34,638 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 233 [2020-10-16 05:06:34,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 376 flow. Second operand 5 states. [2020-10-16 05:06:34,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:34,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 233 [2020-10-16 05:06:34,639 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:35,200 INFO L129 PetriNetUnfolder]: 1613/3376 cut-off events. [2020-10-16 05:06:35,201 INFO L130 PetriNetUnfolder]: For 7961/11193 co-relation queries the response was YES. [2020-10-16 05:06:35,223 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13051 conditions, 3376 events. 1613/3376 cut-off events. For 7961/11193 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 29513 event pairs, 417 based on Foata normal form. 1254/4335 useless extension candidates. Maximal degree in co-relation 13023. Up to 2284 conditions per place. [2020-10-16 05:06:35,234 INFO L132 encePairwiseOnDemand]: 226/233 looper letters, 10 selfloop transitions, 19 changer transitions 0/70 dead transitions. [2020-10-16 05:06:35,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 70 transitions, 501 flow [2020-10-16 05:06:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:06:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:06:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1403 transitions. [2020-10-16 05:06:35,239 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8602084610668301 [2020-10-16 05:06:35,239 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1403 transitions. [2020-10-16 05:06:35,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1403 transitions. [2020-10-16 05:06:35,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:35,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1403 transitions. [2020-10-16 05:06:35,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:06:35,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:06:35,246 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:06:35,246 INFO L185 Difference]: Start difference. First operand has 65 places, 58 transitions, 376 flow. Second operand 7 states and 1403 transitions. [2020-10-16 05:06:35,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 70 transitions, 501 flow [2020-10-16 05:06:35,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 483 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 05:06:35,263 INFO L241 Difference]: Finished difference. Result has 71 places, 66 transitions, 483 flow [2020-10-16 05:06:35,263 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=483, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2020-10-16 05:06:35,263 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2020-10-16 05:06:35,263 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 483 flow [2020-10-16 05:06:35,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:06:35,264 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:35,264 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:35,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:06:35,264 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash 933000405, now seen corresponding path program 1 times [2020-10-16 05:06:35,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:35,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869219413] [2020-10-16 05:06:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:35,422 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-16 05:06:35,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869219413] [2020-10-16 05:06:35,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:35,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:35,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51938558] [2020-10-16 05:06:35,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:06:35,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:06:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:06:35,426 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 233 [2020-10-16 05:06:35,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 483 flow. Second operand 6 states. [2020-10-16 05:06:35,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:35,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 233 [2020-10-16 05:06:35,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:36,029 INFO L129 PetriNetUnfolder]: 1299/2893 cut-off events. [2020-10-16 05:06:36,029 INFO L130 PetriNetUnfolder]: For 12968/21220 co-relation queries the response was YES. [2020-10-16 05:06:36,043 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14866 conditions, 2893 events. 1299/2893 cut-off events. For 12968/21220 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 25992 event pairs, 184 based on Foata normal form. 1556/4195 useless extension candidates. Maximal degree in co-relation 14835. Up to 2116 conditions per place. [2020-10-16 05:06:36,051 INFO L132 encePairwiseOnDemand]: 226/233 looper letters, 6 selfloop transitions, 28 changer transitions 4/79 dead transitions. [2020-10-16 05:06:36,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 685 flow [2020-10-16 05:06:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:06:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:06:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1804 transitions. [2020-10-16 05:06:36,056 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.860276585598474 [2020-10-16 05:06:36,056 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1804 transitions. [2020-10-16 05:06:36,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1804 transitions. [2020-10-16 05:06:36,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:36,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1804 transitions. [2020-10-16 05:06:36,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:06:36,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:06:36,062 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:06:36,062 INFO L185 Difference]: Start difference. First operand has 71 places, 66 transitions, 483 flow. Second operand 9 states and 1804 transitions. [2020-10-16 05:06:36,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 685 flow [2020-10-16 05:06:36,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 79 transitions, 635 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 05:06:36,163 INFO L241 Difference]: Finished difference. Result has 79 places, 75 transitions, 611 flow [2020-10-16 05:06:36,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=611, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2020-10-16 05:06:36,164 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 40 predicate places. [2020-10-16 05:06:36,164 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 611 flow [2020-10-16 05:06:36,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:06:36,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:36,164 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:36,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:06:36,165 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1933612870, now seen corresponding path program 1 times [2020-10-16 05:06:36,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:36,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566419091] [2020-10-16 05:06:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:36,285 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-16 05:06:36,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566419091] [2020-10-16 05:06:36,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:36,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:06:36,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141249979] [2020-10-16 05:06:36,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:36,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:36,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:36,288 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 233 [2020-10-16 05:06:36,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 611 flow. Second operand 7 states. [2020-10-16 05:06:36,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:36,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 233 [2020-10-16 05:06:36,290 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:36,744 INFO L129 PetriNetUnfolder]: 1197/2716 cut-off events. [2020-10-16 05:06:36,744 INFO L130 PetriNetUnfolder]: For 15539/19661 co-relation queries the response was YES. [2020-10-16 05:06:36,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14512 conditions, 2716 events. 1197/2716 cut-off events. For 15539/19661 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 24814 event pairs, 155 based on Foata normal form. 1162/3625 useless extension candidates. Maximal degree in co-relation 14478. Up to 1291 conditions per place. [2020-10-16 05:06:36,766 INFO L132 encePairwiseOnDemand]: 226/233 looper letters, 2 selfloop transitions, 33 changer transitions 5/80 dead transitions. [2020-10-16 05:06:36,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 80 transitions, 745 flow [2020-10-16 05:06:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:06:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:06:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2197 transitions. [2020-10-16 05:06:36,773 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8571985953960203 [2020-10-16 05:06:36,773 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2197 transitions. [2020-10-16 05:06:36,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2197 transitions. [2020-10-16 05:06:36,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:36,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2197 transitions. [2020-10-16 05:06:36,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:06:36,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:06:36,782 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:06:36,782 INFO L185 Difference]: Start difference. First operand has 79 places, 75 transitions, 611 flow. Second operand 11 states and 2197 transitions. [2020-10-16 05:06:36,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 80 transitions, 745 flow [2020-10-16 05:06:37,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 631 flow, removed 39 selfloop flow, removed 6 redundant places. [2020-10-16 05:06:37,082 INFO L241 Difference]: Finished difference. Result has 86 places, 75 transitions, 585 flow [2020-10-16 05:06:37,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=585, PETRI_PLACES=86, PETRI_TRANSITIONS=75} [2020-10-16 05:06:37,083 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2020-10-16 05:06:37,083 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 75 transitions, 585 flow [2020-10-16 05:06:37,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:37,083 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:37,083 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-16 05:06:37,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:06:37,083 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1387739612, now seen corresponding path program 1 times [2020-10-16 05:06:37,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:37,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676067430] [2020-10-16 05:06:37,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:37,583 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-10-16 05:06:37,707 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2020-10-16 05:06:38,063 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-16 05:06:38,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676067430] [2020-10-16 05:06:38,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:38,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:06:38,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257378119] [2020-10-16 05:06:38,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:06:38,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:38,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:06:38,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:06:38,070 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 233 [2020-10-16 05:06:38,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 75 transitions, 585 flow. Second operand 11 states. [2020-10-16 05:06:38,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:38,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 233 [2020-10-16 05:06:38,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:38,304 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-10-16 05:06:38,554 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-10-16 05:06:38,890 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-10-16 05:06:40,017 INFO L129 PetriNetUnfolder]: 3026/6858 cut-off events. [2020-10-16 05:06:40,017 INFO L130 PetriNetUnfolder]: For 33408/36613 co-relation queries the response was YES. [2020-10-16 05:06:40,053 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29977 conditions, 6858 events. 3026/6858 cut-off events. For 33408/36613 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 73593 event pairs, 32 based on Foata normal form. 431/6731 useless extension candidates. Maximal degree in co-relation 29941. Up to 1845 conditions per place. [2020-10-16 05:06:40,066 INFO L132 encePairwiseOnDemand]: 223/233 looper letters, 32 selfloop transitions, 32 changer transitions 12/121 dead transitions. [2020-10-16 05:06:40,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 1029 flow [2020-10-16 05:06:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:06:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:06:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1551 transitions. [2020-10-16 05:06:40,072 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6656652360515022 [2020-10-16 05:06:40,072 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1551 transitions. [2020-10-16 05:06:40,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1551 transitions. [2020-10-16 05:06:40,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:40,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1551 transitions. [2020-10-16 05:06:40,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:06:40,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:06:40,080 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:06:40,080 INFO L185 Difference]: Start difference. First operand has 86 places, 75 transitions, 585 flow. Second operand 10 states and 1551 transitions. [2020-10-16 05:06:40,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 1029 flow [2020-10-16 05:06:41,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 906 flow, removed 31 selfloop flow, removed 10 redundant places. [2020-10-16 05:06:41,295 INFO L241 Difference]: Finished difference. Result has 91 places, 99 transitions, 766 flow [2020-10-16 05:06:41,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=766, PETRI_PLACES=91, PETRI_TRANSITIONS=99} [2020-10-16 05:06:41,296 INFO L342 CegarLoopForPetriNet]: 39 programPoint places, 52 predicate places. [2020-10-16 05:06:41,296 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 766 flow [2020-10-16 05:06:41,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:06:41,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:41,296 INFO L255 CegarLoopForPetriNet]: 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] [2020-10-16 05:06:41,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:06:41,296 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1137276768, now seen corresponding path program 2 times [2020-10-16 05:06:41,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:41,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056028203] [2020-10-16 05:06:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:06:41,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:06:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:06:41,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:06:41,522 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:06:41,522 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:06:41,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:06:41,524 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:06:41,555 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1789] [1789] L3-->L889: Formula: (let ((.cse8 (= (mod ~x$w_buff1_used~0_In1695380144 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In1695380144 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1695380144 256) 0)) (.cse10 (= (mod ~x$r_buff0_thd0~0_In1695380144 256) 0))) (let ((.cse0 (not .cse10)) (.cse1 (not .cse9)) (.cse2 (or .cse9 .cse10)) (.cse3 (not .cse7)) (.cse4 (not .cse8)) (.cse5 (or .cse7 .cse8))) (and (= ~x$r_buff1_thd0~0_Out1695380144 ~x$r_buff1_thd0~0_In1695380144) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out1695380144 0)) (and (= ~x$w_buff0_used~0_Out1695380144 ~x$w_buff0_used~0_In1695380144) .cse2)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out1695380144)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1695380144 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1695380144|) (= ~x$r_buff0_thd0~0_In1695380144 ~x$r_buff0_thd0~0_Out1695380144) (or (and (= ~x$w_buff1_used~0_Out1695380144 0) .cse3 .cse4) (and .cse5 (= ~x$w_buff1_used~0_In1695380144 ~x$w_buff1_used~0_Out1695380144))) (let ((.cse6 (select |#memory_int_In1695380144| |~#x~0.base_In1695380144|))) (or (and .cse0 .cse1 (= (store |#memory_int_In1695380144| |~#x~0.base_In1695380144| (store .cse6 |~#x~0.offset_In1695380144| ~x$w_buff0~0_In1695380144)) |#memory_int_Out1695380144|)) (and .cse2 (or (and .cse3 .cse4 (= (store |#memory_int_In1695380144| |~#x~0.base_In1695380144| (store .cse6 |~#x~0.offset_In1695380144| ~x$w_buff1~0_In1695380144)) |#memory_int_Out1695380144|)) (and .cse5 (= |#memory_int_Out1695380144| (store |#memory_int_In1695380144| |~#x~0.base_In1695380144| (store .cse6 |~#x~0.offset_In1695380144| (select .cse6 |~#x~0.offset_In1695380144|)))))))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1695380144, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1695380144, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1695380144|, ~#x~0.offset=|~#x~0.offset_In1695380144|, ~x$w_buff1~0=~x$w_buff1~0_In1695380144, #memory_int=|#memory_int_In1695380144|, ~#x~0.base=|~#x~0.base_In1695380144|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1695380144, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1695380144, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1695380144} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1695380144, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1695380144, ~#x~0.offset=|~#x~0.offset_In1695380144|, ~x$w_buff1~0=~x$w_buff1~0_In1695380144, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1695380144, ULTIMATE.start_main_#t~ite104=|ULTIMATE.start_main_#t~ite104_Out1695380144|, ULTIMATE.start_main_#t~ite105=|ULTIMATE.start_main_#t~ite105_Out1695380144|, ULTIMATE.start_main_#t~ite106=|ULTIMATE.start_main_#t~ite106_Out1695380144|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1695380144, ULTIMATE.start_main_#t~ite107=|ULTIMATE.start_main_#t~ite107_Out1695380144|, ULTIMATE.start_main_#t~ite108=|ULTIMATE.start_main_#t~ite108_Out1695380144|, ULTIMATE.start_main_#t~ite109=|ULTIMATE.start_main_#t~ite109_Out1695380144|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1695380144, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1695380144|, ULTIMATE.start_main_#t~mem103=|ULTIMATE.start_main_#t~mem103_Out1695380144|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1695380144, #memory_int=|#memory_int_Out1695380144|, ~#x~0.base=|~#x~0.base_In1695380144|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite104, ULTIMATE.start_main_#t~ite105, ULTIMATE.start_main_#t~ite106, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite107, ULTIMATE.start_main_#t~ite108, ULTIMATE.start_main_#t~ite109, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem103, ULTIMATE.start_assume_abort_if_not_~cond, #memory_int] because there is no mapped edge [2020-10-16 05:06:41,564 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-16 05:06:41,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,564 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-16 05:06:41,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,565 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-16 05:06:41,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,565 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-16 05:06:41,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,565 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-16 05:06:41,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,566 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-16 05:06:41,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,566 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-16 05:06:41,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,566 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-16 05:06:41,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,567 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-16 05:06:41,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,567 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-16 05:06:41,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,567 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-16 05:06:41,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,569 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-16 05:06:41,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,569 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-16 05:06:41,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,570 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-16 05:06:41,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,570 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-16 05:06:41,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,570 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-16 05:06:41,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,571 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-16 05:06:41,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,571 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-16 05:06:41,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,571 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-16 05:06:41,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,572 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-16 05:06:41,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,572 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-16 05:06:41,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,572 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-16 05:06:41,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,573 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-16 05:06:41,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,573 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-16 05:06:41,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,573 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-16 05:06:41,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,574 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-16 05:06:41,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,574 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-16 05:06:41,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,575 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-16 05:06:41,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,575 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-16 05:06:41,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,575 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-16 05:06:41,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,576 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-16 05:06:41,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,576 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-16 05:06:41,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,576 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-16 05:06:41,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,577 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-16 05:06:41,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,577 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-16 05:06:41,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,577 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-16 05:06:41,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,578 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-16 05:06:41,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,578 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-16 05:06:41,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,578 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-16 05:06:41,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,579 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-16 05:06:41,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,580 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-16 05:06:41,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,581 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-16 05:06:41,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:06:41,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:06:41 BasicIcfg [2020-10-16 05:06:41,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:06:41,714 INFO L168 Benchmark]: Toolchain (without parser) took 32087.95 ms. Allocated memory was 254.3 MB in the beginning and 965.2 MB in the end (delta: 710.9 MB). Free memory was 209.6 MB in the beginning and 304.9 MB in the end (delta: -95.3 MB). Peak memory consumption was 615.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,715 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:06:41,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.47 ms. Allocated memory was 254.3 MB in the beginning and 322.4 MB in the end (delta: 68.2 MB). Free memory was 209.6 MB in the beginning and 268.1 MB in the end (delta: -58.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 322.4 MB. Free memory was 268.1 MB in the beginning and 265.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,719 INFO L168 Benchmark]: Boogie Preprocessor took 52.34 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 263.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,724 INFO L168 Benchmark]: RCFGBuilder took 3806.82 ms. Allocated memory was 322.4 MB in the beginning and 427.8 MB in the end (delta: 105.4 MB). Free memory was 263.1 MB in the beginning and 305.7 MB in the end (delta: -42.6 MB). Peak memory consumption was 151.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,725 INFO L168 Benchmark]: TraceAbstraction took 27325.60 ms. Allocated memory was 427.8 MB in the beginning and 965.2 MB in the end (delta: 537.4 MB). Free memory was 305.7 MB in the beginning and 304.9 MB in the end (delta: 797.2 kB). Peak memory consumption was 538.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:06:41,732 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.17 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 833.47 ms. Allocated memory was 254.3 MB in the beginning and 322.4 MB in the end (delta: 68.2 MB). Free memory was 209.6 MB in the beginning and 268.1 MB in the end (delta: -58.5 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.88 ms. Allocated memory is still 322.4 MB. Free memory was 268.1 MB in the beginning and 265.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 52.34 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 263.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3806.82 ms. Allocated memory was 322.4 MB in the beginning and 427.8 MB in the end (delta: 105.4 MB). Free memory was 263.1 MB in the beginning and 305.7 MB in the end (delta: -42.6 MB). Peak memory consumption was 151.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 27325.60 ms. Allocated memory was 427.8 MB in the beginning and 965.2 MB in the end (delta: 537.4 MB). Free memory was 305.7 MB in the beginning and 304.9 MB in the end (delta: 797.2 kB). Peak memory consumption was 538.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1447 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.9s, 133 PlacesBefore, 39 PlacesAfterwards, 122 TransitionsBefore, 26 TransitionsAfterwards, 2274 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 5446 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L704] 0 int __unbuffered_p0_EBX = 0; [L706] 0 int __unbuffered_p2_EAX = 0; [L707] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L708] 0 int __unbuffered_p2_EAX$mem_tmp; [L709] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L710] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L711] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L712] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L713] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L714] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L719] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L720] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L721] 0 int __unbuffered_p2_EAX$w_buff0; [L722] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L723] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L729] 0 _Bool x$flush_delayed; [L730] 0 int x$mem_tmp; [L731] 0 _Bool x$r_buff0_thd0; [L732] 0 _Bool x$r_buff0_thd1; [L733] 0 _Bool x$r_buff0_thd2; [L734] 0 _Bool x$r_buff0_thd3; [L735] 0 _Bool x$r_buff0_thd4; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$r_buff1_thd3; [L740] 0 _Bool x$r_buff1_thd4; [L741] 0 _Bool x$read_delayed; [L742] 0 int *x$read_delayed_var; [L743] 0 int x$w_buff0; [L744] 0 _Bool x$w_buff0_used; [L745] 0 int x$w_buff1; [L746] 0 _Bool x$w_buff1_used; [L748] 0 int y = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice1; [L751] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2229; [L872] FCALL, FORK 0 pthread_create(&t2229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L873] 0 pthread_t t2230; [L874] FCALL, FORK 0 pthread_create(&t2230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2231; [L876] FCALL, FORK 0 pthread_create(&t2231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2232; [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 x$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(x) [L813] 3 x$mem_tmp = x [L814] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L816] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L817] EXPR 3 !x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))) [L817] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L818] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] EXPR 3 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))) [L819] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L878] FCALL, FORK 0 pthread_create(&t2232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=0, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=0, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 1 x$flush_delayed = weak$$choice2 [L761] EXPR 1 \read(x) [L761] 1 x$mem_tmp = x [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L762] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0 [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L763] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L763] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1 [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L764] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L764] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L765] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L767] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L768] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 \read(x) [L769] 1 __unbuffered_p0_EBX = x [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] EXPR 1 \read(x) [L770] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L770] 1 x = x$flush_delayed ? x$mem_tmp : x [L771] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 1 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L793] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=255, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L800] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=1, weak$$choice2=255, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 125 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.0s, HoareTripleCheckerStatistics: 59 SDtfs, 32 SDslu, 26 SDs, 0 SdLazy, 672 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 37028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...