/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:32:32,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:32:32,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:32:32,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:32:32,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:32:32,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:32:32,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:32:32,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:32:32,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:32:32,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:32:32,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:32:32,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:32:32,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:32:32,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:32:32,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:32:32,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:32:32,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:32:32,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:32:32,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:32:32,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:32:32,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:32:32,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:32:32,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:32:32,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:32:32,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:32:32,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:32:32,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:32:32,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:32:32,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:32:32,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:32:32,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:32:32,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:32:32,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:32:32,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:32:32,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:32:32,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:32:32,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:32:32,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:32:32,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:32:32,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:32:32,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:32:32,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:32:32,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:32:32,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:32:32,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:32:32,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:32:32,445 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:32:32,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:32:32,445 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:32:32,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:32:32,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:32:32,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:32:32,447 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:32:32,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:32:32,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:32:32,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:32:32,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:32:32,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:32:32,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:32:32,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:32:32,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:32:32,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:32:32,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:32:32,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:32:32,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:32:32,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:32:32,450 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-09 12:32:32,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:32:32,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:32:32,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:32:32,863 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:32:32,864 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:32:32,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-11-09 12:32:32,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0c3aa35/6b8a615246ba43bfb76a292219269e88/FLAGe160c0b5b [2020-11-09 12:32:33,677 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:32:33,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2020-11-09 12:32:33,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0c3aa35/6b8a615246ba43bfb76a292219269e88/FLAGe160c0b5b [2020-11-09 12:32:33,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df0c3aa35/6b8a615246ba43bfb76a292219269e88 [2020-11-09 12:32:33,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:32:33,985 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:32:33,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:32:33,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:32:33,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:32:33,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:33" (1/1) ... [2020-11-09 12:32:33,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f45127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:33, skipping insertion in model container [2020-11-09 12:32:33,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:33" (1/1) ... [2020-11-09 12:32:34,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:32:34,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:32:34,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:32:34,594 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:32:34,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:32:34,762 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:32:34,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34 WrapperNode [2020-11-09 12:32:34,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:32:34,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:32:34,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:32:34,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:32:34,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:32:34,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:32:34,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:32:34,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:32:34,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... [2020-11-09 12:32:34,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:32:34,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:32:34,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:32:34,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:32:34,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:32:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:32:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:32:34,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:32:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:32:34,983 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:32:34,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:32:34,985 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:32:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:32:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:32:34,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:32:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:32:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:32:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:32:34,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:32:34,991 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:32:37,310 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:32:37,310 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:32:37,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:37 BoogieIcfgContainer [2020-11-09 12:32:37,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:32:37,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:32:37,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:32:37,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:32:37,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:33" (1/3) ... [2020-11-09 12:32:37,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3bf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:37, skipping insertion in model container [2020-11-09 12:32:37,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:34" (2/3) ... [2020-11-09 12:32:37,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3bf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:37, skipping insertion in model container [2020-11-09 12:32:37,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:37" (3/3) ... [2020-11-09 12:32:37,321 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2020-11-09 12:32:37,338 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:32:37,338 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:32:37,342 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:32:37,343 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:32:37,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,380 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,380 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,381 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,388 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,389 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,395 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,407 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,410 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:37,412 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:32:37,425 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 12:32:37,448 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:32:37,449 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:32:37,449 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:32:37,449 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:32:37,449 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:32:37,449 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:32:37,449 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:32:37,450 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:32:37,463 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:32:37,466 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 12:32:37,469 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-11-09 12:32:37,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-11-09 12:32:37,521 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-11-09 12:32:37,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:32:37,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-11-09 12:32:37,530 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2020-11-09 12:32:37,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:37,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:37,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:37,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:37,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-09 12:32:37,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:37,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:37,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 12:32:38,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:38,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:38,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:38,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:32:38,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:38,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:38,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,644 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 12:32:38,769 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 12:32:38,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:38,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:38,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:38,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:38,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:38,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:39,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-09 12:32:39,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:39,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:39,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,281 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-09 12:32:39,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,283 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-09 12:32:39,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:39,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:32:39,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:39,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,589 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-09 12:32:39,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,592 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-09 12:32:39,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:39,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:32:39,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:39,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:32:39,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:39,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:39,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:39,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:39,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:39,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,860 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-09 12:32:39,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,862 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-09 12:32:39,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:39,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:39,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:39,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,253 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-09 12:32:40,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:40,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:32:40,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:40,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:40,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:40,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:40,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:40,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:40,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-09 12:32:40,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,617 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-09 12:32:40,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,619 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-09 12:32:40,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 12:32:40,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:32:40,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:40,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:40,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:40,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:40,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:40,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:41,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:41,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:32:41,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:41,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 12:32:41,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:41,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:41,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 12:32:41,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:41,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:41,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:42,525 WARN L194 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-11-09 12:32:42,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-09 12:32:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:42,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:42,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:43,558 WARN L194 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-11-09 12:32:46,055 WARN L194 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 12:32:46,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:32:46,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:46,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:46,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:32:46,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:46,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:46,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:46,095 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-09 12:32:46,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 12:32:46,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 12:32:46,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:46,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,112 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-11-09 12:32:46,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 12:32:46,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:32:46,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:46,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:32:46,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:46,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:50,571 WARN L194 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 368 DAG size of output: 284 [2020-11-09 12:32:50,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:50,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:50,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:50,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:50,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:32:50,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:50,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:32:50,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:50,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:50,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:51,542 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 12:32:51,688 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:32:52,249 WARN L194 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 12:32:52,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:32:52,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:52,711 WARN L194 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 12:32:53,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:53,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:53,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:53,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:53,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:53,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-09 12:32:53,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:53,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:53,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:53,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:53,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:53,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:53,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:53,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:53,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,074 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-09 12:32:53,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,076 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-09 12:32:53,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:53,243 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 12:32:53,431 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-09 12:32:53,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:53,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:54,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:54,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-09 12:32:54,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:54,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:54,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:54,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:54,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-09 12:32:54,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:54,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,309 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-09 12:32:54,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,314 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-09 12:32:54,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:54,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:54,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-09 12:32:54,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:54,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:54,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:55,743 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 12:32:55,897 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 12:32:56,049 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 12:32:56,201 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-09 12:32:56,821 WARN L194 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 12:32:57,103 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 12:32:57,703 WARN L194 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 12:32:57,979 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 12:32:57,986 INFO L131 LiptonReduction]: Checked pairs total: 5459 [2020-11-09 12:32:57,986 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-09 12:32:57,993 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-09 12:32:58,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 890 states. [2020-11-09 12:32:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states. [2020-11-09 12:32:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 12:32:58,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:58,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:58,080 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-09 12:32:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:58,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1633841239, now seen corresponding path program 1 times [2020-11-09 12:32:58,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:58,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59994361] [2020-11-09 12:32:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:58,508 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-09 12:32:58,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59994361] [2020-11-09 12:32:58,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:58,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:32:58,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395659070] [2020-11-09 12:32:58,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:32:58,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:32:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:58,543 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 3 states. [2020-11-09 12:32:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:58,719 INFO L93 Difference]: Finished difference Result 770 states and 2434 transitions. [2020-11-09 12:32:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:32:58,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 12:32:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:58,749 INFO L225 Difference]: With dead ends: 770 [2020-11-09 12:32:58,749 INFO L226 Difference]: Without dead ends: 650 [2020-11-09 12:32:58,751 INFO L677 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-09 12:32:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-09 12:32:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-09 12:32:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-09 12:32:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2020-11-09 12:32:58,855 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2020-11-09 12:32:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:58,856 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2020-11-09 12:32:58,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:32:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2020-11-09 12:32:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 12:32:58,858 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:58,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:58,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:32:58,859 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-09 12:32:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1097574933, now seen corresponding path program 1 times [2020-11-09 12:32:58,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:58,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194560047] [2020-11-09 12:32:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,020 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-09 12:32:59,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194560047] [2020-11-09 12:32:59,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:32:59,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381165461] [2020-11-09 12:32:59,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:32:59,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:32:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:32:59,024 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand 4 states. [2020-11-09 12:32:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,125 INFO L93 Difference]: Finished difference Result 766 states and 2300 transitions. [2020-11-09 12:32:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:32:59,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 12:32:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,133 INFO L225 Difference]: With dead ends: 766 [2020-11-09 12:32:59,133 INFO L226 Difference]: Without dead ends: 646 [2020-11-09 12:32:59,134 INFO L677 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-09 12:32:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2020-11-09 12:32:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2020-11-09 12:32:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-09 12:32:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 2012 transitions. [2020-11-09 12:32:59,195 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 2012 transitions. Word has length 10 [2020-11-09 12:32:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,195 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 2012 transitions. [2020-11-09 12:32:59,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:32:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 2012 transitions. [2020-11-09 12:32:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:32:59,198 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:32:59,199 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-09 12:32:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1173726375, now seen corresponding path program 1 times [2020-11-09 12:32:59,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694757245] [2020-11-09 12:32:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,374 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-09 12:32:59,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694757245] [2020-11-09 12:32:59,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:32:59,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501803960] [2020-11-09 12:32:59,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:32:59,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:32:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:59,382 INFO L87 Difference]: Start difference. First operand 646 states and 2012 transitions. Second operand 5 states. [2020-11-09 12:32:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,517 INFO L93 Difference]: Finished difference Result 742 states and 2226 transitions. [2020-11-09 12:32:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:32:59,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 12:32:59,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,525 INFO L225 Difference]: With dead ends: 742 [2020-11-09 12:32:59,526 INFO L226 Difference]: Without dead ends: 634 [2020-11-09 12:32:59,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-11-09 12:32:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2020-11-09 12:32:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-11-09 12:32:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1968 transitions. [2020-11-09 12:32:59,558 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1968 transitions. Word has length 11 [2020-11-09 12:32:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,559 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 1968 transitions. [2020-11-09 12:32:59,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:32:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1968 transitions. [2020-11-09 12:32:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:32:59,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:32:59,565 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-09 12:32:59,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,566 INFO L82 PathProgramCache]: Analyzing trace with hash 334864770, now seen corresponding path program 1 times [2020-11-09 12:32:59,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130216737] [2020-11-09 12:32:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,822 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-09 12:32:59,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130216737] [2020-11-09 12:32:59,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:32:59,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331085675] [2020-11-09 12:32:59,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:32:59,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:32:59,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:59,827 INFO L87 Difference]: Start difference. First operand 634 states and 1968 transitions. Second operand 5 states. [2020-11-09 12:33:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:00,021 INFO L93 Difference]: Finished difference Result 714 states and 2137 transitions. [2020-11-09 12:33:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:33:00,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 12:33:00,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:00,035 INFO L225 Difference]: With dead ends: 714 [2020-11-09 12:33:00,035 INFO L226 Difference]: Without dead ends: 614 [2020-11-09 12:33:00,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-09 12:33:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-11-09 12:33:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2020-11-09 12:33:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2020-11-09 12:33:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1892 transitions. [2020-11-09 12:33:00,073 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1892 transitions. Word has length 11 [2020-11-09 12:33:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:00,074 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 1892 transitions. [2020-11-09 12:33:00,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:33:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1892 transitions. [2020-11-09 12:33:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:33:00,075 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:00,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:00,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:33:00,076 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-09 12:33:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 824940273, now seen corresponding path program 1 times [2020-11-09 12:33:00,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:00,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331120012] [2020-11-09 12:33:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:00,211 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-09 12:33:00,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331120012] [2020-11-09 12:33:00,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:00,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:33:00,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664849431] [2020-11-09 12:33:00,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:33:00,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:00,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:33:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:33:00,213 INFO L87 Difference]: Start difference. First operand 614 states and 1892 transitions. Second operand 6 states. [2020-11-09 12:33:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:00,473 INFO L93 Difference]: Finished difference Result 648 states and 1910 transitions. [2020-11-09 12:33:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 12:33:00,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-09 12:33:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:00,481 INFO L225 Difference]: With dead ends: 648 [2020-11-09 12:33:00,481 INFO L226 Difference]: Without dead ends: 546 [2020-11-09 12:33:00,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:33:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-11-09 12:33:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2020-11-09 12:33:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-11-09 12:33:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1640 transitions. [2020-11-09 12:33:00,504 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1640 transitions. Word has length 12 [2020-11-09 12:33:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:00,504 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1640 transitions. [2020-11-09 12:33:00,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:33:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1640 transitions. [2020-11-09 12:33:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:33:00,506 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:00,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:00,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:33:00,506 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-09 12:33:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash -196721364, now seen corresponding path program 1 times [2020-11-09 12:33:00,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:00,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610480199] [2020-11-09 12:33:00,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:00,962 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-09 12:33:00,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610480199] [2020-11-09 12:33:00,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:00,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:33:00,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771824530] [2020-11-09 12:33:00,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:33:00,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:00,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:33:00,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:33:00,964 INFO L87 Difference]: Start difference. First operand 546 states and 1640 transitions. Second operand 7 states. [2020-11-09 12:33:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:01,145 INFO L93 Difference]: Finished difference Result 578 states and 1696 transitions. [2020-11-09 12:33:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:33:01,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-11-09 12:33:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:01,153 INFO L225 Difference]: With dead ends: 578 [2020-11-09 12:33:01,154 INFO L226 Difference]: Without dead ends: 530 [2020-11-09 12:33:01,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:33:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-09 12:33:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-11-09 12:33:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-09 12:33:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1588 transitions. [2020-11-09 12:33:01,175 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1588 transitions. Word has length 13 [2020-11-09 12:33:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:01,175 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1588 transitions. [2020-11-09 12:33:01,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:33:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1588 transitions. [2020-11-09 12:33:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:33:01,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:01,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:01,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:33:01,177 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-09 12:33:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1802984383, now seen corresponding path program 1 times [2020-11-09 12:33:01,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:01,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639445357] [2020-11-09 12:33:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:01,313 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-09 12:33:01,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639445357] [2020-11-09 12:33:01,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:01,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:33:01,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136439309] [2020-11-09 12:33:01,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:33:01,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:33:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:33:01,316 INFO L87 Difference]: Start difference. First operand 530 states and 1588 transitions. Second operand 5 states. [2020-11-09 12:33:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:01,406 INFO L93 Difference]: Finished difference Result 554 states and 1626 transitions. [2020-11-09 12:33:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:33:01,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 12:33:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:01,411 INFO L225 Difference]: With dead ends: 554 [2020-11-09 12:33:01,411 INFO L226 Difference]: Without dead ends: 514 [2020-11-09 12:33:01,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:33:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-09 12:33:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-11-09 12:33:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-11-09 12:33:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1536 transitions. [2020-11-09 12:33:01,430 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1536 transitions. Word has length 14 [2020-11-09 12:33:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:01,431 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1536 transitions. [2020-11-09 12:33:01,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:33:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1536 transitions. [2020-11-09 12:33:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:33:01,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:01,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:01,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:33:01,433 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-09 12:33:01,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash -120329848, now seen corresponding path program 1 times [2020-11-09 12:33:01,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:01,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160788805] [2020-11-09 12:33:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:01,850 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-09 12:33:01,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160788805] [2020-11-09 12:33:01,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:01,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:33:01,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29833336] [2020-11-09 12:33:01,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:33:01,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:33:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:33:01,853 INFO L87 Difference]: Start difference. First operand 514 states and 1536 transitions. Second operand 8 states. [2020-11-09 12:33:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:02,102 INFO L93 Difference]: Finished difference Result 658 states and 1960 transitions. [2020-11-09 12:33:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:33:02,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 12:33:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:02,108 INFO L225 Difference]: With dead ends: 658 [2020-11-09 12:33:02,108 INFO L226 Difference]: Without dead ends: 626 [2020-11-09 12:33:02,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:33:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2020-11-09 12:33:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2020-11-09 12:33:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2020-11-09 12:33:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1880 transitions. [2020-11-09 12:33:02,133 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1880 transitions. Word has length 15 [2020-11-09 12:33:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:02,134 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 1880 transitions. [2020-11-09 12:33:02,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:33:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1880 transitions. [2020-11-09 12:33:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:33:02,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:02,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:02,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:33:02,136 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-09 12:33:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2357488, now seen corresponding path program 2 times [2020-11-09 12:33:02,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:02,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491742804] [2020-11-09 12:33:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:33:02,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491742804] [2020-11-09 12:33:02,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:02,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:33:02,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953930172] [2020-11-09 12:33:02,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:33:02,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:33:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:33:02,557 INFO L87 Difference]: Start difference. First operand 626 states and 1880 transitions. Second operand 8 states. [2020-11-09 12:33:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:02,835 INFO L93 Difference]: Finished difference Result 742 states and 2187 transitions. [2020-11-09 12:33:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:33:02,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 12:33:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:02,842 INFO L225 Difference]: With dead ends: 742 [2020-11-09 12:33:02,843 INFO L226 Difference]: Without dead ends: 702 [2020-11-09 12:33:02,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:33:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2020-11-09 12:33:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 646. [2020-11-09 12:33:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-09 12:33:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1939 transitions. [2020-11-09 12:33:02,873 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1939 transitions. Word has length 15 [2020-11-09 12:33:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:02,873 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 1939 transitions. [2020-11-09 12:33:02,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:33:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1939 transitions. [2020-11-09 12:33:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:33:02,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:02,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:02,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:33:02,876 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-09 12:33:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -70511608, now seen corresponding path program 3 times [2020-11-09 12:33:02,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:02,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717133904] [2020-11-09 12:33:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:03,182 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-09 12:33:03,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717133904] [2020-11-09 12:33:03,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:03,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:33:03,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789564110] [2020-11-09 12:33:03,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:33:03,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:33:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:33:03,184 INFO L87 Difference]: Start difference. First operand 646 states and 1939 transitions. Second operand 8 states. [2020-11-09 12:33:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:03,415 INFO L93 Difference]: Finished difference Result 750 states and 2229 transitions. [2020-11-09 12:33:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:33:03,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 12:33:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:03,422 INFO L225 Difference]: With dead ends: 750 [2020-11-09 12:33:03,422 INFO L226 Difference]: Without dead ends: 718 [2020-11-09 12:33:03,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:33:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-11-09 12:33:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 646. [2020-11-09 12:33:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2020-11-09 12:33:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1939 transitions. [2020-11-09 12:33:03,473 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1939 transitions. Word has length 15 [2020-11-09 12:33:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:03,473 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 1939 transitions. [2020-11-09 12:33:03,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:33:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1939 transitions. [2020-11-09 12:33:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:33:03,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:03,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:03,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:33:03,476 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-09 12:33:03,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash -680005476, now seen corresponding path program 1 times [2020-11-09 12:33:03,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:03,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933802254] [2020-11-09 12:33:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:03,557 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-09 12:33:03,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933802254] [2020-11-09 12:33:03,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:03,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:33:03,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563407286] [2020-11-09 12:33:03,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:33:03,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:03,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:33:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:33:03,559 INFO L87 Difference]: Start difference. First operand 646 states and 1939 transitions. Second operand 4 states. [2020-11-09 12:33:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:03,608 INFO L93 Difference]: Finished difference Result 616 states and 1635 transitions. [2020-11-09 12:33:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:33:03,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 12:33:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:03,612 INFO L225 Difference]: With dead ends: 616 [2020-11-09 12:33:03,612 INFO L226 Difference]: Without dead ends: 452 [2020-11-09 12:33:03,612 INFO L677 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-09 12:33:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-11-09 12:33:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-11-09 12:33:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-11-09 12:33:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1163 transitions. [2020-11-09 12:33:03,628 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1163 transitions. Word has length 15 [2020-11-09 12:33:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:03,628 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1163 transitions. [2020-11-09 12:33:03,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:33:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1163 transitions. [2020-11-09 12:33:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:33:03,629 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:03,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:03,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:33:03,630 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2102562398, now seen corresponding path program 1 times [2020-11-09 12:33:03,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:03,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068129779] [2020-11-09 12:33:03,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:03,732 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-09 12:33:03,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068129779] [2020-11-09 12:33:03,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:03,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:33:03,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369521751] [2020-11-09 12:33:03,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:33:03,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:33:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:33:03,734 INFO L87 Difference]: Start difference. First operand 452 states and 1163 transitions. Second operand 5 states. [2020-11-09 12:33:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:03,808 INFO L93 Difference]: Finished difference Result 353 states and 831 transitions. [2020-11-09 12:33:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:33:03,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 12:33:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:03,811 INFO L225 Difference]: With dead ends: 353 [2020-11-09 12:33:03,811 INFO L226 Difference]: Without dead ends: 270 [2020-11-09 12:33:03,812 INFO L677 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-09 12:33:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-09 12:33:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-11-09 12:33:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-11-09 12:33:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 617 transitions. [2020-11-09 12:33:03,820 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 617 transitions. Word has length 16 [2020-11-09 12:33:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:03,820 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 617 transitions. [2020-11-09 12:33:03,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:33:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 617 transitions. [2020-11-09 12:33:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:33:03,822 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:03,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:03,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:33:03,822 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:03,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash -656693885, now seen corresponding path program 1 times [2020-11-09 12:33:03,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:03,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638465050] [2020-11-09 12:33:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:03,935 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-09 12:33:03,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638465050] [2020-11-09 12:33:03,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:03,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:33:03,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661947090] [2020-11-09 12:33:03,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:33:03,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:33:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:33:03,939 INFO L87 Difference]: Start difference. First operand 270 states and 617 transitions. Second operand 6 states. [2020-11-09 12:33:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:04,065 INFO L93 Difference]: Finished difference Result 508 states and 1097 transitions. [2020-11-09 12:33:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:33:04,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 12:33:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:04,068 INFO L225 Difference]: With dead ends: 508 [2020-11-09 12:33:04,068 INFO L226 Difference]: Without dead ends: 284 [2020-11-09 12:33:04,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:33:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-11-09 12:33:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 246. [2020-11-09 12:33:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-09 12:33:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 521 transitions. [2020-11-09 12:33:04,076 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 521 transitions. Word has length 18 [2020-11-09 12:33:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:04,076 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 521 transitions. [2020-11-09 12:33:04,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:33:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 521 transitions. [2020-11-09 12:33:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:33:04,077 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:04,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:04,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:33:04,078 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:04,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 928085199, now seen corresponding path program 1 times [2020-11-09 12:33:04,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:04,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917603997] [2020-11-09 12:33:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:04,214 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-09 12:33:04,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917603997] [2020-11-09 12:33:04,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:04,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:33:04,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428070439] [2020-11-09 12:33:04,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:33:04,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:33:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:33:04,216 INFO L87 Difference]: Start difference. First operand 246 states and 521 transitions. Second operand 8 states. [2020-11-09 12:33:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:04,433 INFO L93 Difference]: Finished difference Result 371 states and 765 transitions. [2020-11-09 12:33:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:33:04,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-11-09 12:33:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:04,436 INFO L225 Difference]: With dead ends: 371 [2020-11-09 12:33:04,436 INFO L226 Difference]: Without dead ends: 242 [2020-11-09 12:33:04,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:33:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-09 12:33:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-11-09 12:33:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-09 12:33:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 497 transitions. [2020-11-09 12:33:04,444 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 497 transitions. Word has length 19 [2020-11-09 12:33:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:04,444 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 497 transitions. [2020-11-09 12:33:04,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:33:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 497 transitions. [2020-11-09 12:33:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:33:04,445 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:04,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:04,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:33:04,445 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash 351150345, now seen corresponding path program 1 times [2020-11-09 12:33:04,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:04,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892917903] [2020-11-09 12:33:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:04,714 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-09 12:33:04,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892917903] [2020-11-09 12:33:04,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:04,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:33:04,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180878606] [2020-11-09 12:33:04,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:33:04,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:33:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:33:04,716 INFO L87 Difference]: Start difference. First operand 242 states and 497 transitions. Second operand 7 states. [2020-11-09 12:33:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:04,905 INFO L93 Difference]: Finished difference Result 286 states and 564 transitions. [2020-11-09 12:33:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:33:04,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 12:33:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:04,908 INFO L225 Difference]: With dead ends: 286 [2020-11-09 12:33:04,909 INFO L226 Difference]: Without dead ends: 234 [2020-11-09 12:33:04,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:33:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2020-11-09 12:33:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2020-11-09 12:33:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-09 12:33:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 413 transitions. [2020-11-09 12:33:04,916 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 413 transitions. Word has length 19 [2020-11-09 12:33:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:04,916 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 413 transitions. [2020-11-09 12:33:04,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:33:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 413 transitions. [2020-11-09 12:33:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:33:04,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:04,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:33:04,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:33:04,918 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -533573773, now seen corresponding path program 1 times [2020-11-09 12:33:04,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:04,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417732083] [2020-11-09 12:33:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:05,007 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-09 12:33:05,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417732083] [2020-11-09 12:33:05,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:05,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:33:05,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567775706] [2020-11-09 12:33:05,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:33:05,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:05,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:33:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:33:05,009 INFO L87 Difference]: Start difference. First operand 206 states and 413 transitions. Second operand 6 states. [2020-11-09 12:33:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:05,093 INFO L93 Difference]: Finished difference Result 182 states and 365 transitions. [2020-11-09 12:33:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:33:05,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 12:33:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:05,095 INFO L225 Difference]: With dead ends: 182 [2020-11-09 12:33:05,095 INFO L226 Difference]: Without dead ends: 100 [2020-11-09 12:33:05,095 INFO L677 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-09 12:33:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-09 12:33:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-11-09 12:33:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-09 12:33:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 193 transitions. [2020-11-09 12:33:05,099 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 193 transitions. Word has length 19 [2020-11-09 12:33:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:05,100 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 193 transitions. [2020-11-09 12:33:05,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:33:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 193 transitions. [2020-11-09 12:33:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:33:05,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:05,102 INFO L422 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-09 12:33:05,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:33:05,102 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash 787666036, now seen corresponding path program 1 times [2020-11-09 12:33:05,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:05,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150817062] [2020-11-09 12:33:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:05,261 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-09 12:33:05,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150817062] [2020-11-09 12:33:05,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:05,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:33:05,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102214318] [2020-11-09 12:33:05,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:33:05,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:05,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:33:05,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:33:05,264 INFO L87 Difference]: Start difference. First operand 100 states and 193 transitions. Second operand 7 states. [2020-11-09 12:33:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:05,359 INFO L93 Difference]: Finished difference Result 123 states and 232 transitions. [2020-11-09 12:33:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:33:05,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-09 12:33:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:05,361 INFO L225 Difference]: With dead ends: 123 [2020-11-09 12:33:05,361 INFO L226 Difference]: Without dead ends: 59 [2020-11-09 12:33:05,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:33:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-09 12:33:05,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-09 12:33:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-09 12:33:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2020-11-09 12:33:05,365 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 22 [2020-11-09 12:33:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:05,365 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2020-11-09 12:33:05,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:33:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2020-11-09 12:33:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:33:05,366 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:05,366 INFO L422 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-09 12:33:05,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 12:33:05,366 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 453389850, now seen corresponding path program 2 times [2020-11-09 12:33:05,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:05,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101069667] [2020-11-09 12:33:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:33:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:33:05,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101069667] [2020-11-09 12:33:05,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:33:05,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:33:05,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183571917] [2020-11-09 12:33:05,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:33:05,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:33:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:33:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:33:05,559 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 7 states. [2020-11-09 12:33:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:33:05,653 INFO L93 Difference]: Finished difference Result 85 states and 149 transitions. [2020-11-09 12:33:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:33:05,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-09 12:33:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:33:05,654 INFO L225 Difference]: With dead ends: 85 [2020-11-09 12:33:05,654 INFO L226 Difference]: Without dead ends: 37 [2020-11-09 12:33:05,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:33:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-09 12:33:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-09 12:33:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-09 12:33:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2020-11-09 12:33:05,657 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 22 [2020-11-09 12:33:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:33:05,657 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2020-11-09 12:33:05,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:33:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2020-11-09 12:33:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:33:05,657 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:33:05,658 INFO L422 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-09 12:33:05,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 12:33:05,658 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:33:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:33:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1834769304, now seen corresponding path program 3 times [2020-11-09 12:33:05,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:33:05,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654080721] [2020-11-09 12:33:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:33:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:33:05,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:33:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:33:05,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:33:05,821 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:33:05,822 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:33:05,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 12:33:05,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:05 BasicIcfg [2020-11-09 12:33:05,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:33:05,935 INFO L168 Benchmark]: Toolchain (without parser) took 31953.22 ms. Allocated memory was 152.0 MB in the beginning and 343.9 MB in the end (delta: 191.9 MB). Free memory was 126.5 MB in the beginning and 213.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 105.6 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,936 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:33:05,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.42 ms. Allocated memory is still 152.0 MB. Free memory was 125.9 MB in the beginning and 127.1 MB in the end (delta: -1.1 MB). Peak memory consumption was 33.4 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 124.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,938 INFO L168 Benchmark]: Boogie Preprocessor took 62.68 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 121.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,940 INFO L168 Benchmark]: RCFGBuilder took 2415.52 ms. Allocated memory was 152.0 MB in the beginning and 187.7 MB in the end (delta: 35.7 MB). Free memory was 121.8 MB in the beginning and 140.7 MB in the end (delta: -18.9 MB). Peak memory consumption was 99.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,940 INFO L168 Benchmark]: TraceAbstraction took 28618.14 ms. Allocated memory was 187.7 MB in the beginning and 343.9 MB in the end (delta: 156.2 MB). Free memory was 140.2 MB in the beginning and 213.1 MB in the end (delta: -72.9 MB). Peak memory consumption was 82.8 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:05,947 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.22 ms. Allocated memory is still 152.0 MB. Free memory is still 123.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 776.42 ms. Allocated memory is still 152.0 MB. Free memory was 125.9 MB in the beginning and 127.1 MB in the end (delta: -1.1 MB). Peak memory consumption was 33.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 152.0 MB. Free memory was 127.1 MB in the beginning and 124.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 62.68 ms. Allocated memory is still 152.0 MB. Free memory was 124.4 MB in the beginning and 121.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2415.52 ms. Allocated memory was 152.0 MB in the beginning and 187.7 MB in the end (delta: 35.7 MB). Free memory was 121.8 MB in the beginning and 140.7 MB in the end (delta: -18.9 MB). Peak memory consumption was 99.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28618.14 ms. Allocated memory was 187.7 MB in the beginning and 343.9 MB in the end (delta: 156.2 MB). Free memory was 140.2 MB in the beginning and 213.1 MB in the end (delta: -72.9 MB). Peak memory consumption was 82.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1377 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 20.5s, 111 PlacesBefore, 37 PlacesAfterwards, 104 TransitionsBefore, 28 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5459 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 VAL [__unbuffered_cnt=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] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=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] [L745] 1 a = 1 VAL [__unbuffered_cnt=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] [L748] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix045_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=49, weak$$choice2=255, x=2, 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, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.6s, HoareTripleCheckerStatistics: 572 SDtfs, 680 SDslu, 1316 SDs, 0 SdLazy, 603 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.5s 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 194 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 42948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...