/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/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:53:13,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:53:13,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:53:13,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:53:13,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:53:13,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:53:13,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:53:13,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:53:13,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:53:13,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:53:13,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:53:13,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:53:13,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:53:13,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:53:13,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:53:13,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:53:13,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:53:13,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:53:13,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:53:13,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:53:13,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:53:13,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:53:13,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:53:13,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:53:13,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:53:13,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:53:13,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:53:13,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:53:13,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:53:13,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:53:13,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:53:13,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:53:13,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:53:13,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:53:13,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:53:13,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:53:13,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:53:13,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:53:13,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:53:13,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:53:13,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:53:13,831 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:53:13,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:53:13,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:53:13,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:53:13,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:53:13,909 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:53:13,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:53:13,909 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:53:13,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:53:13,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:53:13,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:53:13,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:53:13,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:53:13,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:53:13,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:53:13,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:53:13,913 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:53:13,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:53:13,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:53:13,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:53:13,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:53:13,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:53:13,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:53:13,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:53:13,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:53:13,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:53:13,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:53:13,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:53:13,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:53:13,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:53:13,917 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:53:14,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:53:14,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:53:14,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:53:14,435 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:53:14,435 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:53:14,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-11-09 12:53:14,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2d53c80/349c071eea844f56b6396124c80ae800/FLAG6430cceb7 [2020-11-09 12:53:15,324 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:53:15,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-11-09 12:53:15,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2d53c80/349c071eea844f56b6396124c80ae800/FLAG6430cceb7 [2020-11-09 12:53:15,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2d53c80/349c071eea844f56b6396124c80ae800 [2020-11-09 12:53:15,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:53:15,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:53:15,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:53:15,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:53:15,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:53:15,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:15" (1/1) ... [2020-11-09 12:53:15,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd1810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:15, skipping insertion in model container [2020-11-09 12:53:15,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:53:15" (1/1) ... [2020-11-09 12:53:15,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:53:15,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:53:16,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:53:16,375 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:53:16,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:53:16,622 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:53:16,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16 WrapperNode [2020-11-09 12:53:16,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:53:16,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:53:16,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:53:16,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:53:16,635 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:53:16" (1/1) ... [2020-11-09 12:53:16,658 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:53:16" (1/1) ... [2020-11-09 12:53:16,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:53:16,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:53:16,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:53:16,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:53:16,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (1/1) ... [2020-11-09 12:53:16,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:53:16,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:53:16,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:53:16,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:53:16,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (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:53:16,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:53:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:53:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:53:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:53:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:53:16,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:53:16,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:53:16,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:53:16,877 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:53:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:53:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:53:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:53:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:53:16,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:53:16,882 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:53:19,288 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:53:19,288 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:53:19,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:19 BoogieIcfgContainer [2020-11-09 12:53:19,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:53:19,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:53:19,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:53:19,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:53:19,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:53:15" (1/3) ... [2020-11-09 12:53:19,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11095016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:19, skipping insertion in model container [2020-11-09 12:53:19,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:53:16" (2/3) ... [2020-11-09 12:53:19,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11095016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:53:19, skipping insertion in model container [2020-11-09 12:53:19,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:53:19" (3/3) ... [2020-11-09 12:53:19,299 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-11-09 12:53:19,315 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:53:19,315 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:53:19,319 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:53:19,320 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:53:19,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,361 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,361 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,378 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,378 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,379 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,379 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,383 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,385 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:53:19,388 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:53:19,401 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 12:53:19,425 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:53:19,425 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:53:19,425 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:53:19,425 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:53:19,426 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:53:19,426 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:53:19,426 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:53:19,426 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:53:19,438 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:53:19,441 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 12:53:19,444 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 12:53:19,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-09 12:53:19,495 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-09 12:53:19,496 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:53:19,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 12:53:19,504 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-09 12:53:19,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:53:19,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:19,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:53:19,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:19,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-09 12:53:19,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:19,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:19,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:19,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:19,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:19,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:19,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:19,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:19,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:19,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:19,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:53:20,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:20,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:20,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:53:20,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:20,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:53:20,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:20,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:20,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:53:20,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:20,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:53:20,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:20,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:20,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:20,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:20,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:20,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:20,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:20,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:20,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:20,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:20,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:20,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:20,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:53:20,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:20,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:53:20,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:20,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:20,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:21,998 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 12:53:22,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 12:53:22,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:22,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:22,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:22,960 WARN L194 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 12:53:25,632 WARN L194 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 12:53:25,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:53:25,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,654 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 12:53:25,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:53:25,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,669 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 12:53:25,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:53:25,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:53:25,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:53:25,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:53:25,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:53:25,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:53:25,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:25,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:53:25,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:25,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:53:25,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:29,894 WARN L194 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 362 DAG size of output: 268 [2020-11-09 12:53:30,291 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 12:53:30,423 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 12:53:30,637 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 12:53:31,363 WARN L194 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 12:53:31,524 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 12:53:32,159 WARN L194 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-09 12:53:32,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:53:32,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:32,681 WARN L194 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 12:53:32,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:53:32,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:32,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:53:32,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:32,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:32,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:32,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:32,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:32,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:32,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:32,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:32,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:53:32,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:53:32,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:53:32,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:32,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:32,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:53:32,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:53:32,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:33,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:33,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-09 12:53:33,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:33,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:33,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:33,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:33,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:33,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:33,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:33,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:33,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:33,763 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:53:33,896 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:53:34,144 WARN L194 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 12:53:34,382 WARN L194 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 12:53:34,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:34,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-09 12:53:34,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:53:34,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-09 12:53:34,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:34,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:34,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:34,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:34,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:34,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:36,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:53:36,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:36,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:36,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:36,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-09 12:53:36,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:36,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:36,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:36,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:53:36,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:36,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:53:36,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:53:38,116 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-11-09 12:53:38,955 WARN L194 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 120 [2020-11-09 12:53:41,311 WARN L194 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 266 DAG size of output: 252 [2020-11-09 12:53:43,656 WARN L194 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 251 DAG size of output: 250 [2020-11-09 12:53:44,551 WARN L194 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-11-09 12:53:44,958 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 12:53:48,296 WARN L194 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 258 DAG size of output: 219 [2020-11-09 12:53:49,407 WARN L194 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 218 [2020-11-09 12:53:50,327 WARN L194 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-11-09 12:53:50,757 WARN L194 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 12:53:53,113 WARN L194 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 258 DAG size of output: 220 [2020-11-09 12:53:54,273 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 219 [2020-11-09 12:53:54,721 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 12:53:54,829 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 12:53:54,950 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 12:53:55,064 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-09 12:53:55,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:53:55,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:55,670 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 12:53:55,874 WARN L194 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-09 12:53:56,094 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 12:53:56,299 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-09 12:53:56,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:53:56,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:53:56,862 WARN L194 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-11-09 12:53:57,490 WARN L194 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-09 12:54:00,875 WARN L194 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 270 DAG size of output: 267 [2020-11-09 12:54:02,626 WARN L194 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 264 [2020-11-09 12:54:02,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:54:02,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:54:02,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:54:02,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:54:02,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:54:02,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:54:02,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:54:02,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:54:02,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:54:02,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:54:02,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:54:02,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:54:02,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:54:02,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:54:02,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:54:03,409 WARN L194 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 12:54:03,709 WARN L194 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 12:54:04,336 WARN L194 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 12:54:04,653 WARN L194 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 12:54:04,746 INFO L131 LiptonReduction]: Checked pairs total: 4967 [2020-11-09 12:54:04,747 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-09 12:54:04,754 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-09 12:54:04,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-09 12:54:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-09 12:54:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 12:54:04,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:04,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:04,821 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:54:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1674161771, now seen corresponding path program 1 times [2020-11-09 12:54:04,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:04,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768286345] [2020-11-09 12:54:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:05,158 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:54:05,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768286345] [2020-11-09 12:54:05,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:05,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:54:05,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085572068] [2020-11-09 12:54:05,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:54:05,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:54:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:54:05,203 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-09 12:54:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:05,348 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-09 12:54:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:54:05,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 12:54:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:05,391 INFO L225 Difference]: With dead ends: 550 [2020-11-09 12:54:05,392 INFO L226 Difference]: Without dead ends: 450 [2020-11-09 12:54:05,394 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:54:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-09 12:54:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-09 12:54:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-09 12:54:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-09 12:54:05,525 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-09 12:54:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:05,527 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-09 12:54:05,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:54:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-09 12:54:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:54:05,528 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:05,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:05,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:54:05,529 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:54:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1743214513, now seen corresponding path program 1 times [2020-11-09 12:54:05,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:05,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702788205] [2020-11-09 12:54:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:05,678 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:54:05,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702788205] [2020-11-09 12:54:05,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:05,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:54:05,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117062520] [2020-11-09 12:54:05,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:54:05,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:54:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:54:05,682 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-09 12:54:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:05,702 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-11-09 12:54:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:54:05,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 12:54:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:05,715 INFO L225 Difference]: With dead ends: 440 [2020-11-09 12:54:05,716 INFO L226 Difference]: Without dead ends: 440 [2020-11-09 12:54:05,717 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:54:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-09 12:54:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-09 12:54:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-09 12:54:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-11-09 12:54:05,751 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-11-09 12:54:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:05,751 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-11-09 12:54:05,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:54:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-11-09 12:54:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 12:54:05,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:05,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:05,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:54:05,756 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:54:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash 79771207, now seen corresponding path program 1 times [2020-11-09 12:54:05,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:05,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724168277] [2020-11-09 12:54:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:05,899 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:54:05,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724168277] [2020-11-09 12:54:05,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:05,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:54:05,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856210403] [2020-11-09 12:54:05,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:54:05,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:54:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:54:05,905 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-11-09 12:54:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:05,923 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-11-09 12:54:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:54:05,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 12:54:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:05,930 INFO L225 Difference]: With dead ends: 432 [2020-11-09 12:54:05,930 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 12:54:05,931 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:54:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 12:54:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-11-09 12:54:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-11-09 12:54:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-11-09 12:54:05,947 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 10 [2020-11-09 12:54:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:05,948 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-11-09 12:54:05,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:54:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-11-09 12:54:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:54:05,950 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:05,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:05,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:54:05,950 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:54:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1822060866, now seen corresponding path program 1 times [2020-11-09 12:54:05,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:05,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6961428] [2020-11-09 12:54:05,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:06,108 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:54:06,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6961428] [2020-11-09 12:54:06,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:06,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:54:06,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444065032] [2020-11-09 12:54:06,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:54:06,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:06,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:54:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:06,111 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 4 states. [2020-11-09 12:54:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:06,177 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-11-09 12:54:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:54:06,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 12:54:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:06,184 INFO L225 Difference]: With dead ends: 427 [2020-11-09 12:54:06,184 INFO L226 Difference]: Without dead ends: 427 [2020-11-09 12:54:06,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-09 12:54:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-11-09 12:54:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-09 12:54:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-11-09 12:54:06,201 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-11-09 12:54:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:06,202 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-11-09 12:54:06,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:54:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-11-09 12:54:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:54:06,204 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:06,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:06,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:54:06,205 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:54:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -649314907, now seen corresponding path program 1 times [2020-11-09 12:54:06,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:06,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231800839] [2020-11-09 12:54:06,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:06,348 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:54:06,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231800839] [2020-11-09 12:54:06,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:06,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:54:06,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113834908] [2020-11-09 12:54:06,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:54:06,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:06,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:54:06,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:06,350 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 5 states. [2020-11-09 12:54:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:06,513 INFO L93 Difference]: Finished difference Result 416 states and 1232 transitions. [2020-11-09 12:54:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:54:06,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 12:54:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:06,525 INFO L225 Difference]: With dead ends: 416 [2020-11-09 12:54:06,525 INFO L226 Difference]: Without dead ends: 416 [2020-11-09 12:54:06,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:54:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-11-09 12:54:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-11-09 12:54:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-09 12:54:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-11-09 12:54:06,542 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 12 [2020-11-09 12:54:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:06,543 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-11-09 12:54:06,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:54:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-11-09 12:54:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:54:06,547 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:06,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:06,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:54:06,547 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:54:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash -649314070, now seen corresponding path program 1 times [2020-11-09 12:54:06,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:06,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300772975] [2020-11-09 12:54:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:06,676 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:54:06,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300772975] [2020-11-09 12:54:06,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:06,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:54:06,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625430379] [2020-11-09 12:54:06,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:54:06,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:54:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:06,679 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-11-09 12:54:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:06,750 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-11-09 12:54:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:54:06,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 12:54:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:06,762 INFO L225 Difference]: With dead ends: 420 [2020-11-09 12:54:06,762 INFO L226 Difference]: Without dead ends: 420 [2020-11-09 12:54:06,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-09 12:54:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-11-09 12:54:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-09 12:54:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-11-09 12:54:06,778 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-11-09 12:54:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:06,779 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-11-09 12:54:06,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:54:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-11-09 12:54:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:54:06,780 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:06,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:06,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:54:06,781 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:54:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash -651042940, now seen corresponding path program 2 times [2020-11-09 12:54:06,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:06,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483959636] [2020-11-09 12:54:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:06,922 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:54:06,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483959636] [2020-11-09 12:54:06,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:06,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:54:06,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859875504] [2020-11-09 12:54:06,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:54:06,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:54:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:06,925 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-11-09 12:54:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:07,025 INFO L93 Difference]: Finished difference Result 411 states and 1213 transitions. [2020-11-09 12:54:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:54:07,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 12:54:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:07,031 INFO L225 Difference]: With dead ends: 411 [2020-11-09 12:54:07,032 INFO L226 Difference]: Without dead ends: 411 [2020-11-09 12:54:07,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-09 12:54:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-11-09 12:54:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-09 12:54:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2020-11-09 12:54:07,048 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2020-11-09 12:54:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:07,048 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2020-11-09 12:54:07,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:54:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2020-11-09 12:54:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:54:07,050 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:07,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:07,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:54:07,050 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:54:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1346072291, now seen corresponding path program 1 times [2020-11-09 12:54:07,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:07,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630151055] [2020-11-09 12:54:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:07,199 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:54:07,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630151055] [2020-11-09 12:54:07,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:07,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:54:07,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742319778] [2020-11-09 12:54:07,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:54:07,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:07,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:54:07,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:07,202 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand 5 states. [2020-11-09 12:54:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:07,319 INFO L93 Difference]: Finished difference Result 432 states and 1264 transitions. [2020-11-09 12:54:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:54:07,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 12:54:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:07,341 INFO L225 Difference]: With dead ends: 432 [2020-11-09 12:54:07,341 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 12:54:07,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 12:54:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2020-11-09 12:54:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-09 12:54:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1246 transitions. [2020-11-09 12:54:07,357 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1246 transitions. Word has length 13 [2020-11-09 12:54:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:07,357 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1246 transitions. [2020-11-09 12:54:07,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:54:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1246 transitions. [2020-11-09 12:54:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:54:07,359 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:07,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:07,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:54:07,360 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:54:07,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:07,360 INFO L82 PathProgramCache]: Analyzing trace with hash 233943692, now seen corresponding path program 1 times [2020-11-09 12:54:07,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:07,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426588632] [2020-11-09 12:54:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:07,436 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:54:07,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426588632] [2020-11-09 12:54:07,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:07,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:54:07,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084888867] [2020-11-09 12:54:07,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:54:07,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:07,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:54:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:07,439 INFO L87 Difference]: Start difference. First operand 424 states and 1246 transitions. Second operand 4 states. [2020-11-09 12:54:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:07,485 INFO L93 Difference]: Finished difference Result 585 states and 1675 transitions. [2020-11-09 12:54:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:54:07,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 12:54:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:07,491 INFO L225 Difference]: With dead ends: 585 [2020-11-09 12:54:07,492 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 12:54:07,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 12:54:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2020-11-09 12:54:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-11-09 12:54:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1168 transitions. [2020-11-09 12:54:07,507 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1168 transitions. Word has length 13 [2020-11-09 12:54:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:07,508 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1168 transitions. [2020-11-09 12:54:07,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:54:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1168 transitions. [2020-11-09 12:54:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:54:07,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:07,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:07,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:54:07,510 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:54:07,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:07,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1221433980, now seen corresponding path program 1 times [2020-11-09 12:54:07,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:07,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270756606] [2020-11-09 12:54:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:07,765 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:54:07,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270756606] [2020-11-09 12:54:07,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:07,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:54:07,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909423700] [2020-11-09 12:54:07,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:54:07,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:54:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:54:07,769 INFO L87 Difference]: Start difference. First operand 414 states and 1168 transitions. Second operand 6 states. [2020-11-09 12:54:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:08,027 INFO L93 Difference]: Finished difference Result 468 states and 1279 transitions. [2020-11-09 12:54:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:54:08,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 12:54:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:08,032 INFO L225 Difference]: With dead ends: 468 [2020-11-09 12:54:08,032 INFO L226 Difference]: Without dead ends: 270 [2020-11-09 12:54:08,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:54:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-09 12:54:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2020-11-09 12:54:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-09 12:54:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-11-09 12:54:08,042 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 14 [2020-11-09 12:54:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:08,042 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-11-09 12:54:08,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:54:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-11-09 12:54:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:54:08,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:08,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:08,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:54:08,043 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:54:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:08,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1337648298, now seen corresponding path program 1 times [2020-11-09 12:54:08,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:08,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526588144] [2020-11-09 12:54:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:08,178 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:54:08,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526588144] [2020-11-09 12:54:08,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:08,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:54:08,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898626415] [2020-11-09 12:54:08,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:54:08,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:08,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:54:08,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:54:08,180 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 4 states. [2020-11-09 12:54:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:08,252 INFO L93 Difference]: Finished difference Result 251 states and 586 transitions. [2020-11-09 12:54:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:54:08,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 12:54:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:08,256 INFO L225 Difference]: With dead ends: 251 [2020-11-09 12:54:08,257 INFO L226 Difference]: Without dead ends: 181 [2020-11-09 12:54:08,257 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:54:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-09 12:54:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-11-09 12:54:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-09 12:54:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 411 transitions. [2020-11-09 12:54:08,263 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 411 transitions. Word has length 14 [2020-11-09 12:54:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:08,263 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 411 transitions. [2020-11-09 12:54:08,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:54:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 411 transitions. [2020-11-09 12:54:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:54:08,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:08,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:08,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:54:08,264 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:54:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1350041670, now seen corresponding path program 1 times [2020-11-09 12:54:08,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:08,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518892676] [2020-11-09 12:54:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:08,391 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:54:08,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518892676] [2020-11-09 12:54:08,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:08,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:54:08,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652467368] [2020-11-09 12:54:08,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:54:08,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:54:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:54:08,393 INFO L87 Difference]: Start difference. First operand 181 states and 411 transitions. Second operand 5 states. [2020-11-09 12:54:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:08,480 INFO L93 Difference]: Finished difference Result 150 states and 302 transitions. [2020-11-09 12:54:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:54:08,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 12:54:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:08,485 INFO L225 Difference]: With dead ends: 150 [2020-11-09 12:54:08,485 INFO L226 Difference]: Without dead ends: 112 [2020-11-09 12:54:08,486 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:54:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-09 12:54:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-09 12:54:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-09 12:54:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-11-09 12:54:08,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 15 [2020-11-09 12:54:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:08,491 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-11-09 12:54:08,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:54:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-11-09 12:54:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:54:08,492 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:08,492 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:54:08,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:54:08,492 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:54:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash -380102878, now seen corresponding path program 1 times [2020-11-09 12:54:08,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:08,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577843402] [2020-11-09 12:54:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:08,547 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:54:08,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577843402] [2020-11-09 12:54:08,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:08,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:54:08,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94257530] [2020-11-09 12:54:08,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:54:08,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:54:08,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:54:08,551 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 3 states. [2020-11-09 12:54:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:08,567 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-11-09 12:54:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:54:08,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-09 12:54:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:08,570 INFO L225 Difference]: With dead ends: 151 [2020-11-09 12:54:08,570 INFO L226 Difference]: Without dead ends: 109 [2020-11-09 12:54:08,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:54:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-09 12:54:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-11-09 12:54:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-09 12:54:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-11-09 12:54:08,575 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-11-09 12:54:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:08,575 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-11-09 12:54:08,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:54:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-11-09 12:54:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 12:54:08,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:08,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:54:08,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:54:08,577 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:54:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1101711683, now seen corresponding path program 1 times [2020-11-09 12:54:08,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:08,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624219290] [2020-11-09 12:54:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:54:08,694 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:54:08,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624219290] [2020-11-09 12:54:08,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:54:08,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:54:08,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509557343] [2020-11-09 12:54:08,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:54:08,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:54:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:54:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:54:08,696 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 6 states. [2020-11-09 12:54:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:54:08,816 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-11-09 12:54:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:54:08,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 12:54:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:54:08,820 INFO L225 Difference]: With dead ends: 93 [2020-11-09 12:54:08,820 INFO L226 Difference]: Without dead ends: 35 [2020-11-09 12:54:08,821 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:54:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-09 12:54:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-09 12:54:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-09 12:54:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-11-09 12:54:08,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-11-09 12:54:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:54:08,823 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-11-09 12:54:08,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:54:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-11-09 12:54:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:54:08,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:54:08,824 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] [2020-11-09 12:54:08,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:54:08,825 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:54:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:54:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1131077601, now seen corresponding path program 1 times [2020-11-09 12:54:08,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:54:08,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450465695] [2020-11-09 12:54:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:54:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:54:08,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:54:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:54:08,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:54:09,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:54:09,030 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:54:09,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:54:09,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:54:09 BasicIcfg [2020-11-09 12:54:09,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:54:09,175 INFO L168 Benchmark]: Toolchain (without parser) took 53623.72 ms. Allocated memory was 151.0 MB in the beginning and 270.5 MB in the end (delta: 119.5 MB). Free memory was 125.0 MB in the beginning and 234.0 MB in the end (delta: -108.9 MB). Peak memory consumption was 161.7 MB. Max. memory is 8.0 GB. [2020-11-09 12:54:09,175 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 124.2 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:54:09,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1061.54 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 121.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:54:09,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.02 ms. Allocated memory is still 151.0 MB. Free memory was 121.4 MB in the beginning and 118.8 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:54:09,177 INFO L168 Benchmark]: Boogie Preprocessor took 54.87 ms. Allocated memory is still 151.0 MB. Free memory was 118.8 MB in the beginning and 116.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:54:09,178 INFO L168 Benchmark]: RCFGBuilder took 2529.02 ms. Allocated memory was 151.0 MB in the beginning and 187.7 MB in the end (delta: 36.7 MB). Free memory was 116.7 MB in the beginning and 112.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 74.8 MB. Max. memory is 8.0 GB. [2020-11-09 12:54:09,178 INFO L168 Benchmark]: TraceAbstraction took 49880.86 ms. Allocated memory was 187.7 MB in the beginning and 270.5 MB in the end (delta: 82.8 MB). Free memory was 112.2 MB in the beginning and 234.0 MB in the end (delta: -121.8 MB). Peak memory consumption was 111.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:54:09,181 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 151.0 MB. Free memory was 124.3 MB in the beginning and 124.2 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1061.54 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 121.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 80.02 ms. Allocated memory is still 151.0 MB. Free memory was 121.4 MB in the beginning and 118.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.87 ms. Allocated memory is still 151.0 MB. Free memory was 118.8 MB in the beginning and 116.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2529.02 ms. Allocated memory was 151.0 MB in the beginning and 187.7 MB in the end (delta: 36.7 MB). Free memory was 116.7 MB in the beginning and 112.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 74.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49880.86 ms. Allocated memory was 187.7 MB in the beginning and 270.5 MB in the end (delta: 82.8 MB). Free memory was 112.2 MB in the beginning and 234.0 MB in the end (delta: -121.8 MB). Peak memory consumption was 111.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1114 VarBasedMoverChecksPositive, 77 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 115 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 45.3s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4967 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2504; [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L813] 0 pthread_t t2505; [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L815] 0 pthread_t t2506; [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=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=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=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=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 49.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.3s, HoareTripleCheckerStatistics: 301 SDtfs, 273 SDslu, 345 SDs, 0 SdLazy, 221 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 10928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...