/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 23:19:31,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 23:19:31,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 23:19:31,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 23:19:31,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 23:19:31,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 23:19:31,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 23:19:31,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 23:19:31,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 23:19:31,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 23:19:31,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 23:19:31,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 23:19:31,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 23:19:31,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 23:19:31,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 23:19:31,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 23:19:31,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 23:19:31,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 23:19:31,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 23:19:31,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 23:19:31,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 23:19:31,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 23:19:31,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 23:19:31,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 23:19:31,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 23:19:31,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 23:19:31,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 23:19:31,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 23:19:31,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 23:19:31,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 23:19:31,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 23:19:31,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 23:19:31,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 23:19:31,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 23:19:31,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 23:19:31,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 23:19:31,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 23:19:31,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 23:19:31,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 23:19:31,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 23:19:31,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 23:19:31,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-11 23:19:31,470 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 23:19:31,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 23:19:31,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 23:19:31,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 23:19:31,476 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 23:19:31,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 23:19:31,476 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 23:19:31,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 23:19:31,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 23:19:31,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 23:19:31,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 23:19:31,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 23:19:31,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 23:19:31,479 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 23:19:31,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 23:19:31,479 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 23:19:31,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 23:19:31,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 23:19:31,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 23:19:31,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 23:19:31,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 23:19:31,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:19:31,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 23:19:31,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 23:19:31,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 23:19:31,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 23:19:31,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 23:19:31,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 23:19:31,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-11 23:19:31,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 23:19:31,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 23:19:31,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 23:19:31,919 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 23:19:31,920 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 23:19:31,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2020-11-11 23:19:32,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7a95a7/201ba0ca47bd494795162c44a4eb30c1/FLAG8a1f7101e [2020-11-11 23:19:32,806 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 23:19:32,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2020-11-11 23:19:32,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7a95a7/201ba0ca47bd494795162c44a4eb30c1/FLAG8a1f7101e [2020-11-11 23:19:33,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36d7a95a7/201ba0ca47bd494795162c44a4eb30c1 [2020-11-11 23:19:33,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 23:19:33,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 23:19:33,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 23:19:33,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 23:19:33,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 23:19:33,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b74eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33, skipping insertion in model container [2020-11-11 23:19:33,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 23:19:33,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 23:19:33,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:19:33,550 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 23:19:33,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:19:33,766 INFO L208 MainTranslator]: Completed translation [2020-11-11 23:19:33,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33 WrapperNode [2020-11-11 23:19:33,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 23:19:33,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 23:19:33,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 23:19:33,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 23:19:33,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 23:19:33,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 23:19:33,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 23:19:33,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 23:19:33,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (1/1) ... [2020-11-11 23:19:33,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 23:19:33,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 23:19:33,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 23:19:33,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 23:19:33,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (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-11-11 23:19:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 23:19:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 23:19:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 23:19:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 23:19:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 23:19:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 23:19:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 23:19:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 23:19:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 23:19:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 23:19:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 23:19:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 23:19:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 23:19:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 23:19:34,059 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 23:19:36,432 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 23:19:36,433 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 23:19:36,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:19:36 BoogieIcfgContainer [2020-11-11 23:19:36,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 23:19:36,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 23:19:36,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 23:19:36,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 23:19:36,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:19:33" (1/3) ... [2020-11-11 23:19:36,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5331786f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:19:36, skipping insertion in model container [2020-11-11 23:19:36,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:19:33" (2/3) ... [2020-11-11 23:19:36,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5331786f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:19:36, skipping insertion in model container [2020-11-11 23:19:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:19:36" (3/3) ... [2020-11-11 23:19:36,445 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2020-11-11 23:19:36,463 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 23:19:36,463 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 23:19:36,467 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 23:19:36,468 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 23:19:36,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,510 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,520 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,521 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,528 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:19:36,544 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 23:19:36,555 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-11 23:19:36,580 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 23:19:36,580 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 23:19:36,580 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 23:19:36,581 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 23:19:36,581 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 23:19:36,581 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 23:19:36,581 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 23:19:36,581 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 23:19:36,595 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-11 23:19:36,597 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 105 transitions, 225 flow [2020-11-11 23:19:36,600 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 105 transitions, 225 flow [2020-11-11 23:19:36,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 105 transitions, 225 flow [2020-11-11 23:19:36,654 INFO L129 PetriNetUnfolder]: 3/102 cut-off events. [2020-11-11 23:19:36,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-11 23:19:36,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-11 23:19:36,663 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-11-11 23:19:36,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:36,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:36,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:36,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:36,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:19:36,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:36,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:36,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:36,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:36,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:36,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:36,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:36,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:36,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:36,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:36,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,978 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-11-11 23:19:36,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:36,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:19:36,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:37,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:37,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:37,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:19:37,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:37,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:37,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:37,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:37,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:19:37,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:37,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:19:37,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:37,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:37,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:37,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:37,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:37,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:37,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:37,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:37,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:37,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:37,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,222 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-11-11 23:19:37,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:19:37,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-11 23:19:37,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:37,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:19:37,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:19:37,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:19:37,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:37,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:37,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:37,708 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-11 23:19:37,856 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-11-11 23:19:37,980 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-11 23:19:38,106 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-11 23:19:38,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:38,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:38,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:38,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:38,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:38,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:38,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:38,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:39,924 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-11-11 23:19:39,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-11 23:19:39,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:39,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:39,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:41,527 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-11-11 23:19:44,214 WARN L193 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-11-11 23:19:44,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-11 23:19:44,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:44,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:19:44,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-11 23:19:44,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-11 23:19:44,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-11 23:19:44,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-11 23:19:44,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:44,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-11 23:19:44,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:44,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-11 23:19:44,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:48,408 WARN L193 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 361 DAG size of output: 266 [2020-11-11 23:19:48,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:48,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:48,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:48,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:48,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:48,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:48,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:48,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-11 23:19:48,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:48,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:19:48,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:48,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:48,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:48,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:48,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:48,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:48,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:48,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:48,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:48,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:48,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,989 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-11-11 23:19:48,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:48,991 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-11-11 23:19:48,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:19:49,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:19:49,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:49,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:19:49,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:19:49,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:49,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:49,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-11 23:19:49,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:49,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:49,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:49,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:49,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:49,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:49,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:49,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:49,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:49,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:19:49,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:50,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:19:50,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:51,126 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-11 23:19:51,251 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-11 23:19:51,843 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-11 23:19:51,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-11 23:19:51,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:52,326 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-11 23:19:52,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:52,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:52,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:52,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:52,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:52,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:52,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-11 23:19:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:52,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:52,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:52,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:52,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:52,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:52,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:52,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:52,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:52,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:19:53,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:53,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-11 23:19:53,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-11 23:19:53,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:19:53,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:19:53,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:53,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:19:53,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:19:53,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:19:54,048 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-11 23:19:54,248 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-11 23:19:55,007 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-11 23:19:55,120 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-11 23:19:55,230 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-11 23:19:55,341 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-11 23:19:55,920 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-11 23:19:56,207 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-11 23:19:56,790 WARN L193 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-11 23:19:57,060 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-11 23:19:57,074 INFO L131 LiptonReduction]: Checked pairs total: 4707 [2020-11-11 23:19:57,074 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-11 23:19:57,081 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-11 23:19:57,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 890 states, 886 states have (on average 3.363431151241535) internal successors, (2980), 889 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 890 states, 886 states have (on average 3.363431151241535) internal successors, (2980), 889 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-11 23:19:57,158 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:57,159 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:57,160 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:57,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1817827285, now seen corresponding path program 1 times [2020-11-11 23:19:57,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:57,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375177645] [2020-11-11 23:19:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:57,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375177645] [2020-11-11 23:19:57,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:57,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:19:57,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905318185] [2020-11-11 23:19:57,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:19:57,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:19:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:19:57,493 INFO L87 Difference]: Start difference. First operand has 890 states, 886 states have (on average 3.363431151241535) internal successors, (2980), 889 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:57,588 INFO L93 Difference]: Finished difference Result 770 states and 2434 transitions. [2020-11-11 23:19:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:19:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2020-11-11 23:19:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:57,633 INFO L225 Difference]: With dead ends: 770 [2020-11-11 23:19:57,633 INFO L226 Difference]: Without dead ends: 650 [2020-11-11 23:19:57,634 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:19:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-11 23:19:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-11 23:19:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 3.1248073959938365) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-11-11 23:19:57,777 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-11-11 23:19:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:57,778 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-11-11 23:19:57,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-11-11 23:19:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-11 23:19:57,782 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:57,782 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:57,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 23:19:57,782 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash 351209978, now seen corresponding path program 1 times [2020-11-11 23:19:57,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:57,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541079317] [2020-11-11 23:19:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:57,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541079317] [2020-11-11 23:19:57,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:57,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:19:57,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076043069] [2020-11-11 23:19:57,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:19:57,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:57,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:19:57,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:19:57,967 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:58,054 INFO L93 Difference]: Finished difference Result 730 states and 2192 transitions. [2020-11-11 23:19:58,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:19:58,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2020-11-11 23:19:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:58,060 INFO L225 Difference]: With dead ends: 730 [2020-11-11 23:19:58,061 INFO L226 Difference]: Without dead ends: 610 [2020-11-11 23:19:58,061 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:19:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-11-11 23:19:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-11-11 23:19:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 3.09688013136289) internal successors, (1886), 609 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1886 transitions. [2020-11-11 23:19:58,089 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1886 transitions. Word has length 10 [2020-11-11 23:19:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:58,089 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1886 transitions. [2020-11-11 23:19:58,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1886 transitions. [2020-11-11 23:19:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-11 23:19:58,091 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:58,091 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:58,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 23:19:58,092 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1986689350, now seen corresponding path program 1 times [2020-11-11 23:19:58,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:58,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808249939] [2020-11-11 23:19:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:58,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808249939] [2020-11-11 23:19:58,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:58,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:19:58,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087591647] [2020-11-11 23:19:58,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:19:58,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:58,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:19:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:19:58,210 INFO L87 Difference]: Start difference. First operand 610 states and 1886 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:58,245 INFO L93 Difference]: Finished difference Result 670 states and 1999 transitions. [2020-11-11 23:19:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:19:58,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2020-11-11 23:19:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:58,251 INFO L225 Difference]: With dead ends: 670 [2020-11-11 23:19:58,251 INFO L226 Difference]: Without dead ends: 570 [2020-11-11 23:19:58,252 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:19:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-11-11 23:19:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-11-11 23:19:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.0650263620386644) internal successors, (1744), 569 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1744 transitions. [2020-11-11 23:19:58,275 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1744 transitions. Word has length 11 [2020-11-11 23:19:58,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:58,276 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 1744 transitions. [2020-11-11 23:19:58,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1744 transitions. [2020-11-11 23:19:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:19:58,278 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:58,278 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:58,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 23:19:58,279 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:58,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1457859817, now seen corresponding path program 1 times [2020-11-11 23:19:58,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:58,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796774957] [2020-11-11 23:19:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:58,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796774957] [2020-11-11 23:19:58,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:58,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:19:58,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326518148] [2020-11-11 23:19:58,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:19:58,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:19:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:19:58,619 INFO L87 Difference]: Start difference. First operand 570 states and 1744 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:58,806 INFO L93 Difference]: Finished difference Result 710 states and 2141 transitions. [2020-11-11 23:19:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:19:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2020-11-11 23:19:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:58,812 INFO L225 Difference]: With dead ends: 710 [2020-11-11 23:19:58,812 INFO L226 Difference]: Without dead ends: 630 [2020-11-11 23:19:58,813 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:19:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2020-11-11 23:19:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2020-11-11 23:19:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 629 states have (on average 3.0731319554848966) internal successors, (1933), 629 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1933 transitions. [2020-11-11 23:19:58,838 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1933 transitions. Word has length 12 [2020-11-11 23:19:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:58,838 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 1933 transitions. [2020-11-11 23:19:58,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1933 transitions. [2020-11-11 23:19:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:19:58,840 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:58,840 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:58,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 23:19:58,840 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1788539917, now seen corresponding path program 2 times [2020-11-11 23:19:58,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:58,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769854894] [2020-11-11 23:19:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:59,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769854894] [2020-11-11 23:19:59,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:59,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:19:59,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245972157] [2020-11-11 23:19:59,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:19:59,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:19:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:19:59,114 INFO L87 Difference]: Start difference. First operand 630 states and 1933 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:59,264 INFO L93 Difference]: Finished difference Result 678 states and 2013 transitions. [2020-11-11 23:19:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:19:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2020-11-11 23:19:59,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:59,270 INFO L225 Difference]: With dead ends: 678 [2020-11-11 23:19:59,270 INFO L226 Difference]: Without dead ends: 598 [2020-11-11 23:19:59,271 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:19:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-11-11 23:19:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2020-11-11 23:19:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 3.036850921273032) internal successors, (1813), 597 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1813 transitions. [2020-11-11 23:19:59,297 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1813 transitions. Word has length 12 [2020-11-11 23:19:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:59,298 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 1813 transitions. [2020-11-11 23:19:59,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1813 transitions. [2020-11-11 23:19:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-11 23:19:59,300 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:59,301 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:59,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 23:19:59,301 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash -844941480, now seen corresponding path program 1 times [2020-11-11 23:19:59,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:59,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661605918] [2020-11-11 23:19:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:59,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661605918] [2020-11-11 23:19:59,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:59,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:19:59,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728705075] [2020-11-11 23:19:59,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:19:59,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:59,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:19:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:19:59,399 INFO L87 Difference]: Start difference. First operand 598 states and 1813 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:59,445 INFO L93 Difference]: Finished difference Result 526 states and 1403 transitions. [2020-11-11 23:19:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:19:59,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-11 23:19:59,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:59,449 INFO L225 Difference]: With dead ends: 526 [2020-11-11 23:19:59,449 INFO L226 Difference]: Without dead ends: 394 [2020-11-11 23:19:59,449 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:19:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-11-11 23:19:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2020-11-11 23:19:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.5826972010178118) internal successors, (1015), 393 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1015 transitions. [2020-11-11 23:19:59,462 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1015 transitions. Word has length 14 [2020-11-11 23:19:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:59,463 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 1015 transitions. [2020-11-11 23:19:59,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1015 transitions. [2020-11-11 23:19:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-11 23:19:59,464 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:59,464 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:59,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 23:19:59,464 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:59,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:59,465 INFO L82 PathProgramCache]: Analyzing trace with hash 482526149, now seen corresponding path program 1 times [2020-11-11 23:19:59,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:59,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474055387] [2020-11-11 23:19:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:59,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474055387] [2020-11-11 23:19:59,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:59,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:19:59,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338342904] [2020-11-11 23:19:59,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:19:59,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:19:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:19:59,562 INFO L87 Difference]: Start difference. First operand 394 states and 1015 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:59,626 INFO L93 Difference]: Finished difference Result 293 states and 691 transitions. [2020-11-11 23:19:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:19:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-11 23:19:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:59,629 INFO L225 Difference]: With dead ends: 293 [2020-11-11 23:19:59,630 INFO L226 Difference]: Without dead ends: 230 [2020-11-11 23:19:59,630 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:19:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-11-11 23:19:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2020-11-11 23:19:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.2857142857142856) internal successors, (496), 217 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 496 transitions. [2020-11-11 23:19:59,638 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 496 transitions. Word has length 15 [2020-11-11 23:19:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:59,638 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 496 transitions. [2020-11-11 23:19:59,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 496 transitions. [2020-11-11 23:19:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-11 23:19:59,639 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:19:59,639 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:19:59,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 23:19:59,639 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:19:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:19:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1908893838, now seen corresponding path program 1 times [2020-11-11 23:19:59,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:19:59,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49788032] [2020-11-11 23:19:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:19:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:19:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:19:59,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49788032] [2020-11-11 23:19:59,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:19:59,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:19:59,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407525455] [2020-11-11 23:19:59,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:19:59,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:19:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:19:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:19:59,750 INFO L87 Difference]: Start difference. First operand 218 states and 496 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:19:59,986 INFO L93 Difference]: Finished difference Result 296 states and 650 transitions. [2020-11-11 23:19:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-11 23:19:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-11 23:19:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:19:59,989 INFO L225 Difference]: With dead ends: 296 [2020-11-11 23:19:59,990 INFO L226 Difference]: Without dead ends: 224 [2020-11-11 23:19:59,990 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-11 23:19:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-11 23:19:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2020-11-11 23:19:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.207373271889401) internal successors, (479), 217 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 479 transitions. [2020-11-11 23:19:59,998 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 479 transitions. Word has length 18 [2020-11-11 23:19:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:19:59,998 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 479 transitions. [2020-11-11 23:19:59,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:19:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 479 transitions. [2020-11-11 23:19:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-11 23:19:59,999 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:20:00,000 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:20:00,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 23:20:00,000 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:20:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:20:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -602542896, now seen corresponding path program 2 times [2020-11-11 23:20:00,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:20:00,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714374688] [2020-11-11 23:20:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:20:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:20:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:20:00,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714374688] [2020-11-11 23:20:00,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:20:00,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:20:00,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54899184] [2020-11-11 23:20:00,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 23:20:00,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:20:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 23:20:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-11 23:20:00,098 INFO L87 Difference]: Start difference. First operand 218 states and 479 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:20:00,185 INFO L93 Difference]: Finished difference Result 187 states and 416 transitions. [2020-11-11 23:20:00,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 23:20:00,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-11 23:20:00,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:20:00,187 INFO L225 Difference]: With dead ends: 187 [2020-11-11 23:20:00,187 INFO L226 Difference]: Without dead ends: 93 [2020-11-11 23:20:00,188 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:20:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-11 23:20:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-11 23:20:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0217391304347827) internal successors, (186), 92 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 186 transitions. [2020-11-11 23:20:00,192 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 186 transitions. Word has length 18 [2020-11-11 23:20:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:20:00,192 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 186 transitions. [2020-11-11 23:20:00,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2020-11-11 23:20:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-11 23:20:00,193 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:20:00,193 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:20:00,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 23:20:00,193 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:20:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:20:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1163212743, now seen corresponding path program 1 times [2020-11-11 23:20:00,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:20:00,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567874320] [2020-11-11 23:20:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:20:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:20:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:20:00,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567874320] [2020-11-11 23:20:00,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:20:00,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 23:20:00,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670637023] [2020-11-11 23:20:00,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 23:20:00,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:20:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 23:20:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:20:00,329 INFO L87 Difference]: Start difference. First operand 93 states and 186 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:20:00,474 INFO L93 Difference]: Finished difference Result 120 states and 235 transitions. [2020-11-11 23:20:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-11 23:20:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2020-11-11 23:20:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:20:00,475 INFO L225 Difference]: With dead ends: 120 [2020-11-11 23:20:00,475 INFO L226 Difference]: Without dead ends: 49 [2020-11-11 23:20:00,476 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-11 23:20:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-11 23:20:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-11 23:20:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2020-11-11 23:20:00,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22 [2020-11-11 23:20:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:20:00,480 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2020-11-11 23:20:00,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:20:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2020-11-11 23:20:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-11 23:20:00,481 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:20:00,481 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:20:00,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 23:20:00,481 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:20:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:20:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash 214604067, now seen corresponding path program 2 times [2020-11-11 23:20:00,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:20:00,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973084726] [2020-11-11 23:20:00,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:20:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:20:00,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:20:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:20:00,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:20:00,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 23:20:00,614 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 23:20:00,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 23:20:00,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:20:00 BasicIcfg [2020-11-11 23:20:00,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 23:20:00,731 INFO L168 Benchmark]: Toolchain (without parser) took 27686.58 ms. Allocated memory was 302.0 MB in the beginning and 616.6 MB in the end (delta: 314.6 MB). Free memory was 277.1 MB in the beginning and 484.9 MB in the end (delta: -207.8 MB). Peak memory consumption was 109.4 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,731 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 23:20:00,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.43 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 282.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 39.9 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.19 ms. Allocated memory is still 302.0 MB. Free memory was 282.9 MB in the beginning and 280.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,733 INFO L168 Benchmark]: Boogie Preprocessor took 69.44 ms. Allocated memory is still 302.0 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,736 INFO L168 Benchmark]: RCFGBuilder took 2472.94 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 277.7 MB in the beginning and 311.2 MB in the end (delta: -33.5 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,737 INFO L168 Benchmark]: TraceAbstraction took 24291.26 ms. Allocated memory was 373.3 MB in the beginning and 616.6 MB in the end (delta: 243.3 MB). Free memory was 311.2 MB in the beginning and 484.9 MB in the end (delta: -173.8 MB). Peak memory consumption was 69.5 MB. Max. memory is 16.0 GB. [2020-11-11 23:20:00,744 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 712.43 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 282.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 39.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 120.19 ms. Allocated memory is still 302.0 MB. Free memory was 282.9 MB in the beginning and 280.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 69.44 ms. Allocated memory is still 302.0 MB. Free memory was 279.8 MB in the beginning and 277.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2472.94 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 277.7 MB in the beginning and 311.2 MB in the end (delta: -33.5 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24291.26 ms. Allocated memory was 373.3 MB in the beginning and 616.6 MB in the end (delta: 243.3 MB). Free memory was 311.2 MB in the beginning and 484.9 MB in the end (delta: -173.8 MB). Peak memory consumption was 69.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1294 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 131 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 20.4s, 112 PlacesBefore, 37 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4707 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 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] 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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] 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) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L847] 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) [L848] 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)) [L848] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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) [L851] 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)) [L851] 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)) [L852] 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)) [L852] EXPR 0 !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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix042_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.5s, HoareTripleCheckerStatistics: 284 SDtfs, 382 SDslu, 582 SDs, 0 SdLazy, 291 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 11765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...