/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:41:32,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:41:32,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:41:32,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:41:32,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:41:32,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:41:32,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:41:32,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:41:32,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:41:32,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:41:32,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:41:32,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:41:32,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:41:32,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:41:32,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:41:32,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:41:32,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:41:32,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:41:32,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:41:32,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:41:32,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:41:32,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:41:32,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:41:32,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:41:32,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:41:32,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:41:32,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:41:32,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:41:32,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:41:32,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:41:32,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:41:32,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:41:32,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:41:32,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:41:32,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:41:32,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:41:32,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:41:32,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:41:32,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:41:32,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:41:32,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:41:32,445 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.epf [2020-10-16 01:41:32,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:41:32,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:41:32,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:41:32,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:41:32,488 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:41:32,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:41:32,489 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:41:32,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:41:32,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:41:32,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:41:32,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:41:32,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:41:32,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:41:32,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:41:32,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:41:32,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:41:32,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:41:32,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:41:32,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:41:32,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:41:32,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:41:32,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:41:32,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:41:32,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:41:32,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:41:32,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:41:32,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:41:32,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:41:32,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:41:32,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:41:32,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:41:32,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:41:32,846 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:41:32,846 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:41:32,847 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2020-10-16 01:41:32,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942ae67f3/f546b8e9781445098cde5e9d96701943/FLAG3c258153e [2020-10-16 01:41:33,479 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:41:33,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2020-10-16 01:41:33,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942ae67f3/f546b8e9781445098cde5e9d96701943/FLAG3c258153e [2020-10-16 01:41:33,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942ae67f3/f546b8e9781445098cde5e9d96701943 [2020-10-16 01:41:33,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:41:33,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:41:33,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:41:33,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:41:33,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:41:33,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:41:33" (1/1) ... [2020-10-16 01:41:33,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:33, skipping insertion in model container [2020-10-16 01:41:33,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:41:33" (1/1) ... [2020-10-16 01:41:33,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:41:33,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:41:34,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:41:34,435 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:41:34,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:41:34,620 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:41:34,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34 WrapperNode [2020-10-16 01:41:34,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:41:34,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:41:34,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:41:34,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:41:34,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:41:34,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:41:34,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:41:34,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:41:34,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (1/1) ... [2020-10-16 01:41:34,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:41:34,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:41:34,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:41:34,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:41:34,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (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 01:41:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 01:41:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:41:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:41:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:41:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:41:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:41:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:41:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:41:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:41:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:41:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:41:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:41:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:41:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 01:41:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:41:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:41:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:41:34,840 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 01:41:37,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:41:37,553 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 01:41:37,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:41:37 BoogieIcfgContainer [2020-10-16 01:41:37,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:41:37,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:41:37,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:41:37,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:41:37,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:41:33" (1/3) ... [2020-10-16 01:41:37,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e25b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:41:37, skipping insertion in model container [2020-10-16 01:41:37,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:41:34" (2/3) ... [2020-10-16 01:41:37,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e25b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:41:37, skipping insertion in model container [2020-10-16 01:41:37,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:41:37" (3/3) ... [2020-10-16 01:41:37,565 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i [2020-10-16 01:41:37,578 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:41:37,588 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 01:41:37,589 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:41:37,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,638 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,638 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,642 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,642 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,649 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,649 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,662 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,663 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:41:37,703 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:41:37,731 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:41:37,731 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:41:37,731 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:41:37,731 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:41:37,732 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:41:37,732 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:41:37,732 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:41:37,732 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:41:37,752 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2020-10-16 01:41:37,825 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2020-10-16 01:41:37,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:37,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2020-10-16 01:41:37,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 124 transitions, 268 flow [2020-10-16 01:41:37,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 107 transitions, 226 flow [2020-10-16 01:41:37,844 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:41:37,848 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 107 transitions, 226 flow [2020-10-16 01:41:37,852 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 107 transitions, 226 flow [2020-10-16 01:41:37,853 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 107 transitions, 226 flow [2020-10-16 01:41:37,882 INFO L129 PetriNetUnfolder]: 1/107 cut-off events. [2020-10-16 01:41:37,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:37,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 1/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2020-10-16 01:41:37,886 INFO L117 LiptonReduction]: Number of co-enabled transitions 1430 [2020-10-16 01:41:38,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:41:38,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:38,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 01:41:38,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:38,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:38,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:38,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:38,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:38,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:38,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:39,805 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2020-10-16 01:41:39,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:39,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:39,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:39,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:39,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:39,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,546 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 194 DAG size of output: 174 [2020-10-16 01:41:41,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:41:41,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:41,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:41,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:41,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:41,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:41,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:41,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:41,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:41,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:41,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:41,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:41,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:41,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:41,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:41,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:42,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 01:41:42,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:42,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:42,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:42,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 6, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:41:42,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:42,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:42,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:42,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:42,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:41:42,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:42,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:42,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:42,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:42,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 4, 3, 2, 1] term [2020-10-16 01:41:42,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:42,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 01:41:42,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 2, 1] term [2020-10-16 01:41:42,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:42,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:41:42,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:41:42,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:42,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:42,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:42,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:42,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:42,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:41:42,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:42,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 6, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:41:42,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:42,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:41:42,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:43,195 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-16 01:41:43,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:43,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:43,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:43,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:43,315 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 01:41:44,476 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-16 01:41:44,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 01:41:44,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,127 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 111 [2020-10-16 01:41:45,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:45,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:45,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:45,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:45,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:45,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:45,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:45,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:45,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:45,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:45,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:45,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:45,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:41:45,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:45,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:45,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:45,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:45,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,085 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 01:41:46,195 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 01:41:46,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:41:46,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:46,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:41:46,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:46,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:41:46,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 01:41:46,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:41:46,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:46,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:41:46,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-16 01:41:46,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:46,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:46,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:46,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:46,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:46,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:46,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:47,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,068 WARN L193 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 177 DAG size of output: 160 [2020-10-16 01:41:49,681 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-10-16 01:41:49,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:49,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:41:49,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:49,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:49,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:49,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:49,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:41:49,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:49,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:41:49,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 4, 2, 1] term [2020-10-16 01:41:49,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:41:49,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:41:51,680 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 157 DAG size of output: 156 [2020-10-16 01:41:52,400 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2020-10-16 01:41:53,075 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-16 01:41:53,253 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 01:41:53,815 WARN L193 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 140 [2020-10-16 01:41:54,084 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-10-16 01:41:54,094 INFO L132 LiptonReduction]: Checked pairs total: 4074 [2020-10-16 01:41:54,095 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 01:41:54,100 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16259 [2020-10-16 01:41:54,107 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2020-10-16 01:41:54,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:54,108 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:54,109 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:54,109 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash -546990178, now seen corresponding path program 1 times [2020-10-16 01:41:54,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:54,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829775504] [2020-10-16 01:41:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:54,365 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 01:41:54,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829775504] [2020-10-16 01:41:54,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:54,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:54,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890418357] [2020-10-16 01:41:54,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 01:41:54,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 01:41:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 01:41:54,401 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 214 [2020-10-16 01:41:54,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states. [2020-10-16 01:41:54,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:54,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 214 [2020-10-16 01:41:54,409 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:54,438 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 01:41:54,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:54,440 INFO L80 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2020-10-16 01:41:54,441 INFO L132 encePairwiseOnDemand]: 213/214 looper letters, 0 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2020-10-16 01:41:54,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 58 flow [2020-10-16 01:41:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 01:41:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 01:41:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 413 transitions. [2020-10-16 01:41:54,465 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9649532710280374 [2020-10-16 01:41:54,466 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 413 transitions. [2020-10-16 01:41:54,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 413 transitions. [2020-10-16 01:41:54,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:54,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 413 transitions. [2020-10-16 01:41:54,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 01:41:54,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 01:41:54,493 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 01:41:54,496 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 413 transitions. [2020-10-16 01:41:54,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 58 flow [2020-10-16 01:41:54,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 54 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:41:54,502 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow [2020-10-16 01:41:54,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2020-10-16 01:41:54,507 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2020-10-16 01:41:54,507 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 54 flow [2020-10-16 01:41:54,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 01:41:54,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:54,507 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:54,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:41:54,508 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1671516246, now seen corresponding path program 1 times [2020-10-16 01:41:54,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:54,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891591041] [2020-10-16 01:41:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:54,729 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 01:41:54,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891591041] [2020-10-16 01:41:54,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:54,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:54,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313141060] [2020-10-16 01:41:54,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:54,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:54,738 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 214 [2020-10-16 01:41:54,740 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 54 flow. Second operand 3 states. [2020-10-16 01:41:54,740 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:54,740 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 214 [2020-10-16 01:41:54,741 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:54,893 INFO L129 PetriNetUnfolder]: 44/110 cut-off events. [2020-10-16 01:41:54,894 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:41:54,895 INFO L80 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 110 events. 44/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 385 event pairs, 26 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 196. Up to 74 conditions per place. [2020-10-16 01:41:54,896 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 8 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 01:41:54,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 84 flow [2020-10-16 01:41:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2020-10-16 01:41:54,901 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8271028037383178 [2020-10-16 01:41:54,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2020-10-16 01:41:54,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2020-10-16 01:41:54,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:54,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2020-10-16 01:41:54,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:54,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:54,909 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:54,909 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 54 flow. Second operand 3 states and 531 transitions. [2020-10-16 01:41:54,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 84 flow [2020-10-16 01:41:54,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:41:54,911 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 73 flow [2020-10-16 01:41:54,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2020-10-16 01:41:54,912 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2020-10-16 01:41:54,913 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 73 flow [2020-10-16 01:41:54,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:54,913 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:54,913 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:54,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:41:54,913 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash -277420336, now seen corresponding path program 1 times [2020-10-16 01:41:54,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:54,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905879985] [2020-10-16 01:41:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:55,086 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 01:41:55,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905879985] [2020-10-16 01:41:55,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:55,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:55,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289911962] [2020-10-16 01:41:55,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:55,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:55,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:55,089 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2020-10-16 01:41:55,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 73 flow. Second operand 3 states. [2020-10-16 01:41:55,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:55,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2020-10-16 01:41:55,090 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:55,157 INFO L129 PetriNetUnfolder]: 41/107 cut-off events. [2020-10-16 01:41:55,158 INFO L130 PetriNetUnfolder]: For 24/26 co-relation queries the response was YES. [2020-10-16 01:41:55,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 107 events. 41/107 cut-off events. For 24/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 369 event pairs, 23 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 229. Up to 61 conditions per place. [2020-10-16 01:41:55,159 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 8 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 01:41:55,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 99 flow [2020-10-16 01:41:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2020-10-16 01:41:55,163 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8489096573208723 [2020-10-16 01:41:55,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2020-10-16 01:41:55,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2020-10-16 01:41:55,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:55,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2020-10-16 01:41:55,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:55,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:55,167 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:55,167 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 73 flow. Second operand 3 states and 545 transitions. [2020-10-16 01:41:55,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 99 flow [2020-10-16 01:41:55,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:55,169 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 81 flow [2020-10-16 01:41:55,169 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2020-10-16 01:41:55,170 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2020-10-16 01:41:55,170 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 81 flow [2020-10-16 01:41:55,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:55,170 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:55,170 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:55,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:41:55,171 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -277428024, now seen corresponding path program 1 times [2020-10-16 01:41:55,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:55,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168211776] [2020-10-16 01:41:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:55,269 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 01:41:55,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168211776] [2020-10-16 01:41:55,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:55,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:55,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996598000] [2020-10-16 01:41:55,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:55,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:55,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:55,277 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 214 [2020-10-16 01:41:55,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 81 flow. Second operand 5 states. [2020-10-16 01:41:55,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:55,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 214 [2020-10-16 01:41:55,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:55,328 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2020-10-16 01:41:55,328 INFO L130 PetriNetUnfolder]: For 45/147 co-relation queries the response was YES. [2020-10-16 01:41:55,331 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 59 events. 8/59 cut-off events. For 45/147 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 1 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 118. Up to 14 conditions per place. [2020-10-16 01:41:55,331 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 4 selfloop transitions, 4 changer transitions 2/29 dead transitions. [2020-10-16 01:41:55,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 119 flow [2020-10-16 01:41:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:41:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:41:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 750 transitions. [2020-10-16 01:41:55,336 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8761682242990654 [2020-10-16 01:41:55,336 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 750 transitions. [2020-10-16 01:41:55,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 750 transitions. [2020-10-16 01:41:55,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:55,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 750 transitions. [2020-10-16 01:41:55,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:41:55,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:41:55,342 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:41:55,342 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 81 flow. Second operand 4 states and 750 transitions. [2020-10-16 01:41:55,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 119 flow [2020-10-16 01:41:55,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:55,344 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 92 flow [2020-10-16 01:41:55,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2020-10-16 01:41:55,344 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2020-10-16 01:41:55,344 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 92 flow [2020-10-16 01:41:55,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:55,345 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:55,345 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:55,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:41:55,345 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -9339847, now seen corresponding path program 1 times [2020-10-16 01:41:55,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:55,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438020623] [2020-10-16 01:41:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:55,427 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 01:41:55,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438020623] [2020-10-16 01:41:55,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:55,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:41:55,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929179312] [2020-10-16 01:41:55,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:41:55,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:41:55,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:41:55,430 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 214 [2020-10-16 01:41:55,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 92 flow. Second operand 3 states. [2020-10-16 01:41:55,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:55,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 214 [2020-10-16 01:41:55,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:55,512 INFO L129 PetriNetUnfolder]: 29/85 cut-off events. [2020-10-16 01:41:55,512 INFO L130 PetriNetUnfolder]: For 101/107 co-relation queries the response was YES. [2020-10-16 01:41:55,512 INFO L80 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 85 events. 29/85 cut-off events. For 101/107 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 281 event pairs, 14 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 193. Up to 40 conditions per place. [2020-10-16 01:41:55,513 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 7 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2020-10-16 01:41:55,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 28 transitions, 118 flow [2020-10-16 01:41:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2020-10-16 01:41:55,517 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2020-10-16 01:41:55,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2020-10-16 01:41:55,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2020-10-16 01:41:55,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:55,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2020-10-16 01:41:55,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:55,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:55,520 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:55,520 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 92 flow. Second operand 3 states and 535 transitions. [2020-10-16 01:41:55,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 28 transitions, 118 flow [2020-10-16 01:41:55,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 104 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:41:55,523 INFO L241 Difference]: Finished difference. Result has 40 places, 25 transitions, 89 flow [2020-10-16 01:41:55,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2020-10-16 01:41:55,524 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2020-10-16 01:41:55,524 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 89 flow [2020-10-16 01:41:55,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:41:55,524 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:55,524 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:55,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:41:55,525 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash -983016389, now seen corresponding path program 1 times [2020-10-16 01:41:55,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:55,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720050574] [2020-10-16 01:41:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:55,874 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 01:41:55,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720050574] [2020-10-16 01:41:55,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:55,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:55,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480837773] [2020-10-16 01:41:55,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:55,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:55,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:55,878 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 214 [2020-10-16 01:41:55,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 89 flow. Second operand 6 states. [2020-10-16 01:41:55,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:55,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 214 [2020-10-16 01:41:55,879 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:56,029 INFO L129 PetriNetUnfolder]: 81/184 cut-off events. [2020-10-16 01:41:56,030 INFO L130 PetriNetUnfolder]: For 150/151 co-relation queries the response was YES. [2020-10-16 01:41:56,031 INFO L80 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 184 events. 81/184 cut-off events. For 150/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 764 event pairs, 22 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 462. Up to 123 conditions per place. [2020-10-16 01:41:56,032 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 15 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2020-10-16 01:41:56,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 147 flow [2020-10-16 01:41:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:41:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:41:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2020-10-16 01:41:56,036 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6947040498442367 [2020-10-16 01:41:56,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2020-10-16 01:41:56,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2020-10-16 01:41:56,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:56,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2020-10-16 01:41:56,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:41:56,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:41:56,039 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:41:56,039 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 89 flow. Second operand 3 states and 446 transitions. [2020-10-16 01:41:56,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 147 flow [2020-10-16 01:41:56,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:56,041 INFO L241 Difference]: Finished difference. Result has 41 places, 27 transitions, 102 flow [2020-10-16 01:41:56,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=102, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2020-10-16 01:41:56,042 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2020-10-16 01:41:56,042 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 102 flow [2020-10-16 01:41:56,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:56,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:56,042 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:56,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:41:56,043 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash -408749562, now seen corresponding path program 1 times [2020-10-16 01:41:56,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:56,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912401449] [2020-10-16 01:41:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:56,149 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 01:41:56,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912401449] [2020-10-16 01:41:56,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:56,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:56,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609217500] [2020-10-16 01:41:56,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:41:56,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:41:56,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:41:56,152 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 214 [2020-10-16 01:41:56,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 102 flow. Second operand 4 states. [2020-10-16 01:41:56,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:56,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 214 [2020-10-16 01:41:56,153 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:56,251 INFO L129 PetriNetUnfolder]: 173/333 cut-off events. [2020-10-16 01:41:56,251 INFO L130 PetriNetUnfolder]: For 193/214 co-relation queries the response was YES. [2020-10-16 01:41:56,253 INFO L80 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 333 events. 173/333 cut-off events. For 193/214 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 1705 event pairs, 87 based on Foata normal form. 26/324 useless extension candidates. Maximal degree in co-relation 750. Up to 206 conditions per place. [2020-10-16 01:41:56,255 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2020-10-16 01:41:56,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 168 flow [2020-10-16 01:41:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2020-10-16 01:41:56,259 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8710280373831776 [2020-10-16 01:41:56,260 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2020-10-16 01:41:56,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2020-10-16 01:41:56,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:56,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2020-10-16 01:41:56,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:56,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:56,265 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:56,265 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 102 flow. Second operand 5 states and 932 transitions. [2020-10-16 01:41:56,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 168 flow [2020-10-16 01:41:56,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:56,267 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 174 flow [2020-10-16 01:41:56,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2020-10-16 01:41:56,268 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2020-10-16 01:41:56,268 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 174 flow [2020-10-16 01:41:56,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:41:56,268 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:56,268 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:56,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:41:56,269 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:56,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:56,269 INFO L82 PathProgramCache]: Analyzing trace with hash 158354634, now seen corresponding path program 1 times [2020-10-16 01:41:56,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:56,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361179204] [2020-10-16 01:41:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:56,558 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 26 [2020-10-16 01:41:56,561 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 01:41:56,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361179204] [2020-10-16 01:41:56,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:56,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:41:56,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051140445] [2020-10-16 01:41:56,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:41:56,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:41:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:41:56,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 214 [2020-10-16 01:41:56,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 174 flow. Second operand 7 states. [2020-10-16 01:41:56,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:56,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 214 [2020-10-16 01:41:56,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:57,121 INFO L129 PetriNetUnfolder]: 567/1057 cut-off events. [2020-10-16 01:41:57,122 INFO L130 PetriNetUnfolder]: For 1520/2047 co-relation queries the response was YES. [2020-10-16 01:41:57,128 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 1057 events. 567/1057 cut-off events. For 1520/2047 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 6891 event pairs, 192 based on Foata normal form. 49/994 useless extension candidates. Maximal degree in co-relation 3230. Up to 621 conditions per place. [2020-10-16 01:41:57,136 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 23 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2020-10-16 01:41:57,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 324 flow [2020-10-16 01:41:57,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:41:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:41:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1126 transitions. [2020-10-16 01:41:57,141 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7516688918558078 [2020-10-16 01:41:57,141 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1126 transitions. [2020-10-16 01:41:57,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1126 transitions. [2020-10-16 01:41:57,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:57,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1126 transitions. [2020-10-16 01:41:57,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:41:57,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:41:57,148 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:41:57,148 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 174 flow. Second operand 7 states and 1126 transitions. [2020-10-16 01:41:57,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 324 flow [2020-10-16 01:41:57,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:57,158 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 289 flow [2020-10-16 01:41:57,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2020-10-16 01:41:57,158 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2020-10-16 01:41:57,159 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 289 flow [2020-10-16 01:41:57,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:41:57,159 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:57,159 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:41:57,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:41:57,159 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1748813562, now seen corresponding path program 1 times [2020-10-16 01:41:57,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:57,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47382515] [2020-10-16 01:41:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:57,237 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 01:41:57,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47382515] [2020-10-16 01:41:57,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:57,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:41:57,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243118872] [2020-10-16 01:41:57,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:57,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:57,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:57,240 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 214 [2020-10-16 01:41:57,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 289 flow. Second operand 5 states. [2020-10-16 01:41:57,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:57,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 214 [2020-10-16 01:41:57,241 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:57,441 INFO L129 PetriNetUnfolder]: 356/736 cut-off events. [2020-10-16 01:41:57,441 INFO L130 PetriNetUnfolder]: For 2303/4420 co-relation queries the response was YES. [2020-10-16 01:41:57,446 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 736 events. 356/736 cut-off events. For 2303/4420 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 4757 event pairs, 71 based on Foata normal form. 252/923 useless extension candidates. Maximal degree in co-relation 2938. Up to 509 conditions per place. [2020-10-16 01:41:57,451 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2020-10-16 01:41:57,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 427 flow [2020-10-16 01:41:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:41:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:41:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1305 transitions. [2020-10-16 01:41:57,456 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8711615487316422 [2020-10-16 01:41:57,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1305 transitions. [2020-10-16 01:41:57,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1305 transitions. [2020-10-16 01:41:57,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:57,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1305 transitions. [2020-10-16 01:41:57,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:41:57,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:41:57,464 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:41:57,464 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 289 flow. Second operand 7 states and 1305 transitions. [2020-10-16 01:41:57,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 427 flow [2020-10-16 01:41:57,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 420 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 01:41:57,471 INFO L241 Difference]: Finished difference. Result has 64 places, 57 transitions, 424 flow [2020-10-16 01:41:57,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2020-10-16 01:41:57,471 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2020-10-16 01:41:57,471 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 424 flow [2020-10-16 01:41:57,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:57,472 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:57,472 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 01:41:57,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:41:57,472 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash -322254458, now seen corresponding path program 1 times [2020-10-16 01:41:57,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:57,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313215968] [2020-10-16 01:41:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:57,559 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 01:41:57,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313215968] [2020-10-16 01:41:57,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:57,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:41:57,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122301450] [2020-10-16 01:41:57,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:41:57,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:41:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:41:57,563 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2020-10-16 01:41:57,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 424 flow. Second operand 5 states. [2020-10-16 01:41:57,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:57,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2020-10-16 01:41:57,564 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:57,951 INFO L129 PetriNetUnfolder]: 841/1689 cut-off events. [2020-10-16 01:41:57,951 INFO L130 PetriNetUnfolder]: For 8604/11210 co-relation queries the response was YES. [2020-10-16 01:41:57,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8155 conditions, 1689 events. 841/1689 cut-off events. For 8604/11210 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 12760 event pairs, 124 based on Foata normal form. 96/1640 useless extension candidates. Maximal degree in co-relation 8137. Up to 1171 conditions per place. [2020-10-16 01:41:57,979 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 26 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2020-10-16 01:41:57,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 586 flow [2020-10-16 01:41:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:41:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:41:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 868 transitions. [2020-10-16 01:41:57,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.811214953271028 [2020-10-16 01:41:57,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 868 transitions. [2020-10-16 01:41:57,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 868 transitions. [2020-10-16 01:41:57,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:57,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 868 transitions. [2020-10-16 01:41:57,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:41:57,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:41:57,990 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:41:57,990 INFO L185 Difference]: Start difference. First operand has 64 places, 57 transitions, 424 flow. Second operand 5 states and 868 transitions. [2020-10-16 01:41:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 586 flow [2020-10-16 01:41:58,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 536 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 01:41:58,035 INFO L241 Difference]: Finished difference. Result has 67 places, 58 transitions, 389 flow [2020-10-16 01:41:58,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2020-10-16 01:41:58,035 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2020-10-16 01:41:58,035 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 389 flow [2020-10-16 01:41:58,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:41:58,036 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:58,036 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 01:41:58,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:41:58,036 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1785371484, now seen corresponding path program 2 times [2020-10-16 01:41:58,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:58,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80428785] [2020-10-16 01:41:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:58,122 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 01:41:58,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80428785] [2020-10-16 01:41:58,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:58,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:41:58,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87110269] [2020-10-16 01:41:58,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:41:58,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:41:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:41:58,125 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 214 [2020-10-16 01:41:58,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 389 flow. Second operand 6 states. [2020-10-16 01:41:58,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:58,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 214 [2020-10-16 01:41:58,127 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:58,482 INFO L129 PetriNetUnfolder]: 466/1011 cut-off events. [2020-10-16 01:41:58,483 INFO L130 PetriNetUnfolder]: For 6593/10990 co-relation queries the response was YES. [2020-10-16 01:41:58,489 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 1011 events. 466/1011 cut-off events. For 6593/10990 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 7314 event pairs, 20 based on Foata normal form. 617/1512 useless extension candidates. Maximal degree in co-relation 4882. Up to 643 conditions per place. [2020-10-16 01:41:58,495 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 6 selfloop transitions, 28 changer transitions 5/70 dead transitions. [2020-10-16 01:41:58,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 579 flow [2020-10-16 01:41:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:41:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:41:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1678 transitions. [2020-10-16 01:41:58,501 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8712357217030114 [2020-10-16 01:41:58,501 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1678 transitions. [2020-10-16 01:41:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1678 transitions. [2020-10-16 01:41:58,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:58,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1678 transitions. [2020-10-16 01:41:58,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:41:58,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:41:58,510 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:41:58,510 INFO L185 Difference]: Start difference. First operand has 67 places, 58 transitions, 389 flow. Second operand 9 states and 1678 transitions. [2020-10-16 01:41:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 579 flow [2020-10-16 01:41:58,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:41:58,524 INFO L241 Difference]: Finished difference. Result has 76 places, 65 transitions, 536 flow [2020-10-16 01:41:58,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=536, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2020-10-16 01:41:58,524 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2020-10-16 01:41:58,524 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 536 flow [2020-10-16 01:41:58,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:41:58,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:58,525 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] [2020-10-16 01:41:58,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:41:58,525 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1307358243, now seen corresponding path program 1 times [2020-10-16 01:41:58,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:58,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480354452] [2020-10-16 01:41:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:41:58,631 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 01:41:58,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480354452] [2020-10-16 01:41:58,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:41:58,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:41:58,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658328975] [2020-10-16 01:41:58,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:41:58,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:41:58,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:41:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:41:58,634 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 214 [2020-10-16 01:41:58,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 536 flow. Second operand 7 states. [2020-10-16 01:41:58,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:41:58,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 214 [2020-10-16 01:41:58,636 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:41:58,977 INFO L129 PetriNetUnfolder]: 396/889 cut-off events. [2020-10-16 01:41:58,978 INFO L130 PetriNetUnfolder]: For 8751/13628 co-relation queries the response was YES. [2020-10-16 01:41:58,986 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 889 events. 396/889 cut-off events. For 8751/13628 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 6569 event pairs, 8 based on Foata normal form. 603/1380 useless extension candidates. Maximal degree in co-relation 5296. Up to 545 conditions per place. [2020-10-16 01:41:58,990 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 2 selfloop transitions, 33 changer transitions 11/70 dead transitions. [2020-10-16 01:41:58,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 670 flow [2020-10-16 01:41:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:41:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:41:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2043 transitions. [2020-10-16 01:41:58,998 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8678844519966016 [2020-10-16 01:41:58,998 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2043 transitions. [2020-10-16 01:41:58,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2043 transitions. [2020-10-16 01:41:59,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:41:59,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2043 transitions. [2020-10-16 01:41:59,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:41:59,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:41:59,010 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:41:59,011 INFO L185 Difference]: Start difference. First operand has 76 places, 65 transitions, 536 flow. Second operand 11 states and 2043 transitions. [2020-10-16 01:41:59,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 670 flow [2020-10-16 01:41:59,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 70 transitions, 557 flow, removed 39 selfloop flow, removed 6 redundant places. [2020-10-16 01:41:59,060 INFO L241 Difference]: Finished difference. Result has 83 places, 59 transitions, 475 flow [2020-10-16 01:41:59,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=475, PETRI_PLACES=83, PETRI_TRANSITIONS=59} [2020-10-16 01:41:59,061 INFO L342 CegarLoopForPetriNet]: 36 programPoint places, 47 predicate places. [2020-10-16 01:41:59,061 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 59 transitions, 475 flow [2020-10-16 01:41:59,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:41:59,061 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:41:59,061 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] [2020-10-16 01:41:59,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:41:59,062 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:41:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:41:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2096004272, now seen corresponding path program 1 times [2020-10-16 01:41:59,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:41:59,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643133709] [2020-10-16 01:41:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:41:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:59,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:41:59,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:41:59,270 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:41:59,271 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:41:59,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:41:59,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,303 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,303 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,303 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,310 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,311 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,312 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,313 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,314 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:41:59,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,315 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 01:41:59,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,315 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 01:41:59,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,315 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 01:41:59,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,316 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 01:41:59,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,316 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 01:41:59,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,316 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 01:41:59,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,317 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 01:41:59,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,317 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 01:41:59,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,317 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 01:41:59,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,318 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 01:41:59,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,318 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 01:41:59,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,318 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 01:41:59,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,319 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 01:41:59,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,319 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 01:41:59,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,319 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 01:41:59,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,320 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 01:41:59,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:41:59,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:41:59 BasicIcfg [2020-10-16 01:41:59,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:41:59,424 INFO L168 Benchmark]: Toolchain (without parser) took 25668.98 ms. Allocated memory was 249.0 MB in the beginning and 684.7 MB in the end (delta: 435.7 MB). Free memory was 204.1 MB in the beginning and 430.6 MB in the end (delta: -226.4 MB). Peak memory consumption was 209.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,425 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:41:59,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.88 ms. Allocated memory was 249.0 MB in the beginning and 308.8 MB in the end (delta: 59.8 MB). Free memory was 204.1 MB in the beginning and 257.0 MB in the end (delta: -52.9 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.67 ms. Allocated memory is still 308.8 MB. Free memory was 257.0 MB in the beginning and 252.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,427 INFO L168 Benchmark]: Boogie Preprocessor took 48.63 ms. Allocated memory is still 308.8 MB. Free memory was 252.0 MB in the beginning and 249.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,428 INFO L168 Benchmark]: RCFGBuilder took 2807.07 ms. Allocated memory was 308.8 MB in the beginning and 370.7 MB in the end (delta: 61.9 MB). Free memory was 249.5 MB in the beginning and 243.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 143.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,428 INFO L168 Benchmark]: TraceAbstraction took 21865.14 ms. Allocated memory was 370.7 MB in the beginning and 684.7 MB in the end (delta: 314.0 MB). Free memory was 243.6 MB in the beginning and 430.6 MB in the end (delta: -186.9 MB). Peak memory consumption was 127.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:41:59,432 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.20 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 863.88 ms. Allocated memory was 249.0 MB in the beginning and 308.8 MB in the end (delta: 59.8 MB). Free memory was 204.1 MB in the beginning and 257.0 MB in the end (delta: -52.9 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.67 ms. Allocated memory is still 308.8 MB. Free memory was 257.0 MB in the beginning and 252.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 48.63 ms. Allocated memory is still 308.8 MB. Free memory was 252.0 MB in the beginning and 249.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2807.07 ms. Allocated memory was 308.8 MB in the beginning and 370.7 MB in the end (delta: 61.9 MB). Free memory was 249.5 MB in the beginning and 243.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 143.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 21865.14 ms. Allocated memory was 370.7 MB in the beginning and 684.7 MB in the end (delta: 314.0 MB). Free memory was 243.6 MB in the beginning and 430.6 MB in the end (delta: -186.9 MB). Peak memory consumption was 127.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 883 VarBasedMoverChecksPositive, 96 VarBasedMoverChecksNegative, 34 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 128 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.2s, 119 PlacesBefore, 36 PlacesAfterwards, 107 TransitionsBefore, 24 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, 4074 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; [L703] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L704] 0 int __unbuffered_p0_EAX$mem_tmp; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L713] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L715] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L716] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L717] 0 int __unbuffered_p0_EAX$w_buff0; [L718] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L719] 0 int __unbuffered_p0_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L722] 0 int __unbuffered_p0_EBX = 0; [L724] 0 int __unbuffered_p2_EAX = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice1; [L751] 0 _Bool weak$$choice2; [L842] 0 pthread_t t2241; [L843] FCALL, FORK 0 pthread_create(&t2241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 1 y$flush_delayed = weak$$choice2 [L758] EXPR 1 \read(y) [L758] 1 y$mem_tmp = y [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L760] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L765] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 pthread_t t2242; [L845] FCALL, FORK 0 pthread_create(&t2242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t2243; [L847] FCALL, FORK 0 pthread_create(&t2243, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t2244; [L773] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=11, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L849] FCALL, FORK 0 pthread_create(&t2244, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0: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=11, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 4 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=11, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L803] EXPR 3 \read(y) [L803] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L820] EXPR 4 \read(y) [L820] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L824] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L827] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L829] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] EXPR 0 \read(y) [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 \read(y) [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L874] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L874] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L875] EXPR 0 \read(y) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0: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=10, weak$$choice1=255, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 1 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: 21.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.3s, HoareTripleCheckerStatistics: 43 SDtfs, 56 SDslu, 22 SDs, 0 SdLazy, 349 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=11, 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.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 20557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...