/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:44:43,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:44:43,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:44:43,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:44:43,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:44:43,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:44:43,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:44:43,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:44:43,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:44:43,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:44:43,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:44:43,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:44:43,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:44:43,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:44:43,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:44:43,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:44:43,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:44:43,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:44:43,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:44:43,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:44:43,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:44:43,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:44:43,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:44:43,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:44:43,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:44:43,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:44:43,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:44:43,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:44:43,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:44:43,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:44:43,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:44:43,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:44:43,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:44:43,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:44:43,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:44:43,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:44:43,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:44:43,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:44:43,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:44:43,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:44:43,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:44:43,332 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-10-09 12:44:43,379 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:44:43,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:44:43,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:44:43,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:44:43,382 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:44:43,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:44:43,382 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:44:43,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:44:43,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:44:43,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:44:43,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:44:43,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:44:43,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:44:43,385 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:44:43,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:44:43,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:44:43,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:44:43,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:44:43,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:44:43,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:44:43,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:44:43,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:44:43,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:44:43,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:44:43,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:44:43,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:44:43,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:44:43,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:44:43,388 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:44:43,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:44:43,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:44:43,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:44:43,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:44:43,698 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:44:43,699 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:44:43,700 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2020-10-09 12:44:43,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08899f86/bbffe8c7ff35411fb4a0ddcd22408ae8/FLAG79fe86cd1 [2020-10-09 12:44:44,340 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:44:44,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt.i [2020-10-09 12:44:44,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08899f86/bbffe8c7ff35411fb4a0ddcd22408ae8/FLAG79fe86cd1 [2020-10-09 12:44:44,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08899f86/bbffe8c7ff35411fb4a0ddcd22408ae8 [2020-10-09 12:44:44,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:44:44,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:44:44,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:44:44,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:44:44,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:44:44,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:44:44" (1/1) ... [2020-10-09 12:44:44,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e7396f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:44, skipping insertion in model container [2020-10-09 12:44:44,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:44:44" (1/1) ... [2020-10-09 12:44:44,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:44:44,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:44:45,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:44:45,301 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:44:45,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:44:45,439 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:44:45,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45 WrapperNode [2020-10-09 12:44:45,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:44:45,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:44:45,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:44:45,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:44:45,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:44:45,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:44:45,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:44:45,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:44:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... [2020-10-09 12:44:45,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:44:45,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:44:45,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:44:45,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:44:45,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:44:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:44:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:44:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:44:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:44:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:44:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:44:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:44:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:44:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:44:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:44:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-09 12:44:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-09 12:44:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:44:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:44:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:44:45,627 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:44:47,572 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:44:47,572 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:44:47,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:44:47 BoogieIcfgContainer [2020-10-09 12:44:47,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:44:47,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:44:47,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:44:47,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:44:47,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:44:44" (1/3) ... [2020-10-09 12:44:47,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b86dbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:44:47, skipping insertion in model container [2020-10-09 12:44:47,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:44:45" (2/3) ... [2020-10-09 12:44:47,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b86dbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:44:47, skipping insertion in model container [2020-10-09 12:44:47,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:44:47" (3/3) ... [2020-10-09 12:44:47,584 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_power.opt.i [2020-10-09 12:44:47,596 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:44:47,596 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:44:47,604 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:44:47,605 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:44:47,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,635 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,639 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,649 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,650 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,650 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,650 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,650 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,651 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,661 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,661 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,663 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,664 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,665 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,667 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,668 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:44:47,683 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-09 12:44:47,704 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:44:47,704 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:44:47,704 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:44:47,704 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:44:47,704 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:44:47,705 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:44:47,705 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:44:47,705 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:44:47,718 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:44:47,720 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-09 12:44:47,723 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-09 12:44:47,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-09 12:44:47,775 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-09 12:44:47,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:44:47,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-09 12:44:47,784 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-09 12:44:47,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:47,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:47,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:47,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:47,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:47,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:47,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-09 12:44:47,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:48,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-09 12:44:48,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:44:48,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:48,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:44:48,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-09 12:44:48,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:44:48,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:48,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:48,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:48,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:48,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:48,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:48,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:48,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:48,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:48,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-09 12:44:48,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:49,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:49,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:49,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,268 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-09 12:44:49,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:49,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:49,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:49,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:49,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:49,719 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 12:44:49,952 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 12:44:50,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:44:50,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:50,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-09 12:44:50,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:44:50,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:44:50,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:44:50,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:44:50,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:50,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:50,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-09 12:44:50,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:44:50,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:50,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:44:50,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:50,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-09 12:44:50,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:44:50,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:50,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:50,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-09 12:44:50,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:44:50,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-09 12:44:50,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-09 12:44:50,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:50,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-09 12:44:50,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:44:51,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:44:51,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:44:52,080 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-09 12:44:52,212 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-09 12:44:52,224 INFO L132 LiptonReduction]: Checked pairs total: 6958 [2020-10-09 12:44:52,224 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-09 12:44:52,231 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-09 12:44:52,464 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-09 12:44:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-09 12:44:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 12:44:52,477 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:52,478 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:52,479 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times [2020-10-09 12:44:52,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:52,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335741741] [2020-10-09 12:44:52,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:52,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335741741] [2020-10-09 12:44:52,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:52,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:44:52,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622988702] [2020-10-09 12:44:52,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:44:52,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:52,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:44:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:44:52,776 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-09 12:44:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:52,889 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-09 12:44:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:44:52,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 12:44:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:52,949 INFO L225 Difference]: With dead ends: 3082 [2020-10-09 12:44:52,949 INFO L226 Difference]: Without dead ends: 2602 [2020-10-09 12:44:52,951 INFO L673 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-10-09 12:44:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-09 12:44:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-09 12:44:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-09 12:44:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-09 12:44:53,177 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-09 12:44:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:53,179 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-09 12:44:53,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:44:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-09 12:44:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 12:44:53,183 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:53,183 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:53,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:44:53,184 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash 667621438, now seen corresponding path program 1 times [2020-10-09 12:44:53,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:53,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323064250] [2020-10-09 12:44:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:53,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323064250] [2020-10-09 12:44:53,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:53,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:44:53,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026533417] [2020-10-09 12:44:53,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:53,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:53,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:53,393 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-09 12:44:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:53,477 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-10-09 12:44:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:53,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-09 12:44:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:53,501 INFO L225 Difference]: With dead ends: 2986 [2020-10-09 12:44:53,502 INFO L226 Difference]: Without dead ends: 2506 [2020-10-09 12:44:53,502 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:44:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-09 12:44:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-10-09 12:44:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-09 12:44:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-10-09 12:44:53,675 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-10-09 12:44:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:53,676 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-10-09 12:44:53,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-10-09 12:44:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 12:44:53,679 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:53,679 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:53,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:44:53,680 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash -807545516, now seen corresponding path program 1 times [2020-10-09 12:44:53,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:53,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414993850] [2020-10-09 12:44:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:53,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414993850] [2020-10-09 12:44:53,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:53,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:44:53,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50085256] [2020-10-09 12:44:53,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:53,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:53,849 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states. [2020-10-09 12:44:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:53,911 INFO L93 Difference]: Finished difference Result 2650 states and 9876 transitions. [2020-10-09 12:44:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:53,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-09 12:44:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:53,930 INFO L225 Difference]: With dead ends: 2650 [2020-10-09 12:44:53,931 INFO L226 Difference]: Without dead ends: 2218 [2020-10-09 12:44:53,931 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:44:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-09 12:44:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-10-09 12:44:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-10-09 12:44:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-10-09 12:44:54,014 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 13 [2020-10-09 12:44:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:54,014 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-10-09 12:44:54,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-10-09 12:44:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 12:44:54,017 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:54,018 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:54,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:44:54,018 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1163919253, now seen corresponding path program 1 times [2020-10-09 12:44:54,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:54,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700076174] [2020-10-09 12:44:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:54,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700076174] [2020-10-09 12:44:54,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:54,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:44:54,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476249692] [2020-10-09 12:44:54,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:54,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:54,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:54,108 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-10-09 12:44:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:54,166 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-10-09 12:44:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:54,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-09 12:44:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:54,184 INFO L225 Difference]: With dead ends: 2410 [2020-10-09 12:44:54,184 INFO L226 Difference]: Without dead ends: 2154 [2020-10-09 12:44:54,185 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:44:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-09 12:44:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-09 12:44:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-09 12:44:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-09 12:44:54,259 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-10-09 12:44:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:54,259 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-09 12:44:54,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-09 12:44:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:44:54,263 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:54,263 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:54,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:44:54,264 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:54,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1542213664, now seen corresponding path program 1 times [2020-10-09 12:44:54,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:54,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844635694] [2020-10-09 12:44:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:54,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844635694] [2020-10-09 12:44:54,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:54,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:44:54,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139354616] [2020-10-09 12:44:54,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:54,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:54,357 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states. [2020-10-09 12:44:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:54,410 INFO L93 Difference]: Finished difference Result 3274 states and 11856 transitions. [2020-10-09 12:44:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:54,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-09 12:44:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:54,429 INFO L225 Difference]: With dead ends: 3274 [2020-10-09 12:44:54,429 INFO L226 Difference]: Without dead ends: 2346 [2020-10-09 12:44:54,429 INFO L673 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-10-09 12:44:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-09 12:44:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2090. [2020-10-09 12:44:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-09 12:44:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7536 transitions. [2020-10-09 12:44:54,498 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7536 transitions. Word has length 16 [2020-10-09 12:44:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:54,499 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7536 transitions. [2020-10-09 12:44:54,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7536 transitions. [2020-10-09 12:44:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:44:54,502 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:54,502 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:54,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:44:54,503 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 698962532, now seen corresponding path program 1 times [2020-10-09 12:44:54,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:54,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182396993] [2020-10-09 12:44:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:54,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182396993] [2020-10-09 12:44:54,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:54,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:44:54,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842071057] [2020-10-09 12:44:54,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:44:54,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:44:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:44:54,662 INFO L87 Difference]: Start difference. First operand 2090 states and 7536 transitions. Second operand 6 states. [2020-10-09 12:44:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:54,850 INFO L93 Difference]: Finished difference Result 2554 states and 9136 transitions. [2020-10-09 12:44:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:44:54,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-09 12:44:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:54,868 INFO L225 Difference]: With dead ends: 2554 [2020-10-09 12:44:54,868 INFO L226 Difference]: Without dead ends: 2330 [2020-10-09 12:44:54,869 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:44:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2020-10-09 12:44:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2020-10-09 12:44:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2330 states. [2020-10-09 12:44:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 8424 transitions. [2020-10-09 12:44:54,946 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 8424 transitions. Word has length 16 [2020-10-09 12:44:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:54,946 INFO L481 AbstractCegarLoop]: Abstraction has 2330 states and 8424 transitions. [2020-10-09 12:44:54,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:44:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 8424 transitions. [2020-10-09 12:44:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:44:54,953 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:54,953 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:54,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:44:54,954 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:54,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1090591274, now seen corresponding path program 2 times [2020-10-09 12:44:54,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:54,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840830662] [2020-10-09 12:44:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:55,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840830662] [2020-10-09 12:44:55,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:55,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:44:55,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960354281] [2020-10-09 12:44:55,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:44:55,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:44:55,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:44:55,117 INFO L87 Difference]: Start difference. First operand 2330 states and 8424 transitions. Second operand 6 states. [2020-10-09 12:44:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:55,291 INFO L93 Difference]: Finished difference Result 2498 states and 8860 transitions. [2020-10-09 12:44:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:55,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-09 12:44:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:55,315 INFO L225 Difference]: With dead ends: 2498 [2020-10-09 12:44:55,315 INFO L226 Difference]: Without dead ends: 2274 [2020-10-09 12:44:55,316 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:44:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2020-10-09 12:44:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2020-10-09 12:44:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2020-10-09 12:44:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 8176 transitions. [2020-10-09 12:44:55,391 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 8176 transitions. Word has length 16 [2020-10-09 12:44:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:55,391 INFO L481 AbstractCegarLoop]: Abstraction has 2274 states and 8176 transitions. [2020-10-09 12:44:55,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:44:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 8176 transitions. [2020-10-09 12:44:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:44:55,396 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:55,396 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:55,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:44:55,396 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2030793214, now seen corresponding path program 1 times [2020-10-09 12:44:55,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:55,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939284859] [2020-10-09 12:44:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:55,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939284859] [2020-10-09 12:44:55,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:55,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:44:55,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300410053] [2020-10-09 12:44:55,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:44:55,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:44:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:44:55,557 INFO L87 Difference]: Start difference. First operand 2274 states and 8176 transitions. Second operand 6 states. [2020-10-09 12:44:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:55,687 INFO L93 Difference]: Finished difference Result 2506 states and 8890 transitions. [2020-10-09 12:44:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:44:55,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-09 12:44:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:55,696 INFO L225 Difference]: With dead ends: 2506 [2020-10-09 12:44:55,696 INFO L226 Difference]: Without dead ends: 2338 [2020-10-09 12:44:55,696 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:44:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2020-10-09 12:44:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2194. [2020-10-09 12:44:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2020-10-09 12:44:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 7820 transitions. [2020-10-09 12:44:55,761 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 7820 transitions. Word has length 17 [2020-10-09 12:44:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:55,761 INFO L481 AbstractCegarLoop]: Abstraction has 2194 states and 7820 transitions. [2020-10-09 12:44:55,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:44:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 7820 transitions. [2020-10-09 12:44:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:44:55,766 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:55,766 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:55,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:44:55,766 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1282570242, now seen corresponding path program 2 times [2020-10-09 12:44:55,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:55,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372898819] [2020-10-09 12:44:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:55,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372898819] [2020-10-09 12:44:55,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:55,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:44:55,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590149036] [2020-10-09 12:44:55,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:44:55,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:44:55,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:44:55,988 INFO L87 Difference]: Start difference. First operand 2194 states and 7820 transitions. Second operand 7 states. [2020-10-09 12:44:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:56,159 INFO L93 Difference]: Finished difference Result 2650 states and 9282 transitions. [2020-10-09 12:44:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:44:56,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-09 12:44:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:56,169 INFO L225 Difference]: With dead ends: 2650 [2020-10-09 12:44:56,169 INFO L226 Difference]: Without dead ends: 2426 [2020-10-09 12:44:56,169 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:44:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2020-10-09 12:44:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2266. [2020-10-09 12:44:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2020-10-09 12:44:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 8024 transitions. [2020-10-09 12:44:56,234 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 8024 transitions. Word has length 17 [2020-10-09 12:44:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:56,234 INFO L481 AbstractCegarLoop]: Abstraction has 2266 states and 8024 transitions. [2020-10-09 12:44:56,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:44:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 8024 transitions. [2020-10-09 12:44:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 12:44:56,239 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:56,239 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:56,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:44:56,240 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 336259331, now seen corresponding path program 1 times [2020-10-09 12:44:56,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:56,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927968629] [2020-10-09 12:44:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:56,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927968629] [2020-10-09 12:44:56,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:56,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:44:56,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460834137] [2020-10-09 12:44:56,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:56,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:56,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:56,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:56,334 INFO L87 Difference]: Start difference. First operand 2266 states and 8024 transitions. Second operand 4 states. [2020-10-09 12:44:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:56,377 INFO L93 Difference]: Finished difference Result 2358 states and 7591 transitions. [2020-10-09 12:44:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:56,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-09 12:44:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:56,390 INFO L225 Difference]: With dead ends: 2358 [2020-10-09 12:44:56,390 INFO L226 Difference]: Without dead ends: 1782 [2020-10-09 12:44:56,391 INFO L673 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-10-09 12:44:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2020-10-09 12:44:56,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1782. [2020-10-09 12:44:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2020-10-09 12:44:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5712 transitions. [2020-10-09 12:44:56,436 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 5712 transitions. Word has length 18 [2020-10-09 12:44:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:56,437 INFO L481 AbstractCegarLoop]: Abstraction has 1782 states and 5712 transitions. [2020-10-09 12:44:56,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 5712 transitions. [2020-10-09 12:44:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:44:56,441 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:56,441 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:56,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:44:56,441 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1602332560, now seen corresponding path program 1 times [2020-10-09 12:44:56,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:56,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309771116] [2020-10-09 12:44:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:56,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309771116] [2020-10-09 12:44:56,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:56,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:44:56,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585321396] [2020-10-09 12:44:56,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:44:56,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:44:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:44:56,581 INFO L87 Difference]: Start difference. First operand 1782 states and 5712 transitions. Second operand 5 states. [2020-10-09 12:44:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:56,643 INFO L93 Difference]: Finished difference Result 1515 states and 4414 transitions. [2020-10-09 12:44:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:44:56,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-09 12:44:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:56,647 INFO L225 Difference]: With dead ends: 1515 [2020-10-09 12:44:56,648 INFO L226 Difference]: Without dead ends: 1146 [2020-10-09 12:44:56,648 INFO L673 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-10-09 12:44:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2020-10-09 12:44:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2020-10-09 12:44:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2020-10-09 12:44:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 3270 transitions. [2020-10-09 12:44:56,676 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 3270 transitions. Word has length 19 [2020-10-09 12:44:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:56,676 INFO L481 AbstractCegarLoop]: Abstraction has 1146 states and 3270 transitions. [2020-10-09 12:44:56,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:44:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 3270 transitions. [2020-10-09 12:44:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 12:44:56,679 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:56,679 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:56,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:44:56,680 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:56,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1622927393, now seen corresponding path program 1 times [2020-10-09 12:44:56,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:56,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153350129] [2020-10-09 12:44:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:56,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153350129] [2020-10-09 12:44:56,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:56,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:44:56,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247552917] [2020-10-09 12:44:56,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:44:56,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:44:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:44:56,753 INFO L87 Difference]: Start difference. First operand 1146 states and 3270 transitions. Second operand 5 states. [2020-10-09 12:44:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:56,798 INFO L93 Difference]: Finished difference Result 1563 states and 4357 transitions. [2020-10-09 12:44:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:56,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-09 12:44:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:56,801 INFO L225 Difference]: With dead ends: 1563 [2020-10-09 12:44:56,802 INFO L226 Difference]: Without dead ends: 1026 [2020-10-09 12:44:56,802 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:44:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2020-10-09 12:44:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 984. [2020-10-09 12:44:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-10-09 12:44:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 2672 transitions. [2020-10-09 12:44:56,825 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 2672 transitions. Word has length 21 [2020-10-09 12:44:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:56,825 INFO L481 AbstractCegarLoop]: Abstraction has 984 states and 2672 transitions. [2020-10-09 12:44:56,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:44:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2672 transitions. [2020-10-09 12:44:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 12:44:56,828 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:56,828 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:56,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 12:44:56,829 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1096349146, now seen corresponding path program 1 times [2020-10-09 12:44:56,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:56,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457923271] [2020-10-09 12:44:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:56,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457923271] [2020-10-09 12:44:56,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:56,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:44:56,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494286791] [2020-10-09 12:44:56,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:44:56,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:56,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:44:56,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:44:56,892 INFO L87 Difference]: Start difference. First operand 984 states and 2672 transitions. Second operand 4 states. [2020-10-09 12:44:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:56,927 INFO L93 Difference]: Finished difference Result 1407 states and 3652 transitions. [2020-10-09 12:44:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:44:56,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-09 12:44:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:56,930 INFO L225 Difference]: With dead ends: 1407 [2020-10-09 12:44:56,931 INFO L226 Difference]: Without dead ends: 974 [2020-10-09 12:44:56,931 INFO L673 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-10-09 12:44:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2020-10-09 12:44:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 930. [2020-10-09 12:44:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-09 12:44:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2380 transitions. [2020-10-09 12:44:56,954 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2380 transitions. Word has length 21 [2020-10-09 12:44:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:56,956 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 2380 transitions. [2020-10-09 12:44:56,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:44:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2380 transitions. [2020-10-09 12:44:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-09 12:44:56,960 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:56,960 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:56,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 12:44:56,960 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1643789257, now seen corresponding path program 1 times [2020-10-09 12:44:56,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:56,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670340285] [2020-10-09 12:44:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:57,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670340285] [2020-10-09 12:44:57,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:57,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:44:57,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259723863] [2020-10-09 12:44:57,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:44:57,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:57,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:44:57,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:44:57,108 INFO L87 Difference]: Start difference. First operand 930 states and 2380 transitions. Second operand 6 states. [2020-10-09 12:44:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:57,187 INFO L93 Difference]: Finished difference Result 780 states and 1931 transitions. [2020-10-09 12:44:57,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:44:57,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-09 12:44:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:57,190 INFO L225 Difference]: With dead ends: 780 [2020-10-09 12:44:57,190 INFO L226 Difference]: Without dead ends: 519 [2020-10-09 12:44:57,191 INFO L673 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-10-09 12:44:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-10-09 12:44:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2020-10-09 12:44:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-10-09 12:44:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1136 transitions. [2020-10-09 12:44:57,206 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1136 transitions. Word has length 21 [2020-10-09 12:44:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:57,206 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 1136 transitions. [2020-10-09 12:44:57,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:44:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1136 transitions. [2020-10-09 12:44:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 12:44:57,211 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:57,211 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:57,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-09 12:44:57,211 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:57,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:57,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1155030226, now seen corresponding path program 1 times [2020-10-09 12:44:57,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:57,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635308869] [2020-10-09 12:44:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:57,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635308869] [2020-10-09 12:44:57,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:57,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:44:57,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858557166] [2020-10-09 12:44:57,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:44:57,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:44:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:44:57,541 INFO L87 Difference]: Start difference. First operand 487 states and 1136 transitions. Second operand 7 states. [2020-10-09 12:44:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:57,681 INFO L93 Difference]: Finished difference Result 606 states and 1373 transitions. [2020-10-09 12:44:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:44:57,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-09 12:44:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:57,682 INFO L225 Difference]: With dead ends: 606 [2020-10-09 12:44:57,683 INFO L226 Difference]: Without dead ends: 328 [2020-10-09 12:44:57,684 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:44:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-10-09 12:44:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2020-10-09 12:44:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-10-09 12:44:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-10-09 12:44:57,690 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-10-09 12:44:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:57,691 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-10-09 12:44:57,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:44:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-10-09 12:44:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 12:44:57,693 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:57,693 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:57,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-09 12:44:57,693 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1352959002, now seen corresponding path program 1 times [2020-10-09 12:44:57,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:57,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355009729] [2020-10-09 12:44:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:44:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 12:44:57,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355009729] [2020-10-09 12:44:57,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:44:57,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 12:44:57,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877826461] [2020-10-09 12:44:57,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:44:57,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:44:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:44:57,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:44:57,823 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-10-09 12:44:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:44:57,889 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-10-09 12:44:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:44:57,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-09 12:44:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:44:57,890 INFO L225 Difference]: With dead ends: 293 [2020-10-09 12:44:57,890 INFO L226 Difference]: Without dead ends: 65 [2020-10-09 12:44:57,890 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:44:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-09 12:44:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-09 12:44:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-09 12:44:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-09 12:44:57,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-10-09 12:44:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:44:57,893 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-09 12:44:57,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:44:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-09 12:44:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-09 12:44:57,893 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:44:57,893 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:44:57,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-09 12:44:57,894 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:44:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:44:57,894 INFO L82 PathProgramCache]: Analyzing trace with hash 743532320, now seen corresponding path program 1 times [2020-10-09 12:44:57,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:44:57,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090927186] [2020-10-09 12:44:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:44:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:44:57,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:44:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:44:57,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:44:58,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:44:58,048 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:44:58,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-09 12:44:58,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,087 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,088 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,088 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,089 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,090 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,091 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,092 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,093 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,093 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,099 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,099 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,100 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,101 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 12:44:58,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:44:58,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:44:58 BasicIcfg [2020-10-09 12:44:58,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:44:58,218 INFO L168 Benchmark]: Toolchain (without parser) took 13595.54 ms. Allocated memory was 253.8 MB in the beginning and 611.8 MB in the end (delta: 358.1 MB). Free memory was 206.2 MB in the beginning and 414.9 MB in the end (delta: -208.7 MB). Peak memory consumption was 149.4 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,218 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:44:58,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.70 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 206.2 MB in the beginning and 272.0 MB in the end (delta: -65.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.32 ms. Allocated memory is still 321.9 MB. Free memory was 272.0 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,220 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 321.9 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,221 INFO L168 Benchmark]: RCFGBuilder took 2018.66 ms. Allocated memory was 321.9 MB in the beginning and 361.8 MB in the end (delta: 39.8 MB). Free memory was 267.0 MB in the beginning and 206.9 MB in the end (delta: 60.1 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,222 INFO L168 Benchmark]: TraceAbstraction took 10639.57 ms. Allocated memory was 361.8 MB in the beginning and 611.8 MB in the end (delta: 250.1 MB). Free memory was 206.9 MB in the beginning and 414.9 MB in the end (delta: -208.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 14.2 GB. [2020-10-09 12:44:58,225 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 816.70 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 206.2 MB in the beginning and 272.0 MB in the end (delta: -65.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.32 ms. Allocated memory is still 321.9 MB. Free memory was 272.0 MB in the beginning and 269.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.58 ms. Allocated memory is still 321.9 MB. Free memory was 269.5 MB in the beginning and 267.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2018.66 ms. Allocated memory was 321.9 MB in the beginning and 361.8 MB in the end (delta: 39.8 MB). Free memory was 267.0 MB in the beginning and 206.9 MB in the end (delta: 60.1 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10639.57 ms. Allocated memory was 361.8 MB in the beginning and 611.8 MB in the end (delta: 250.1 MB). Free memory was 206.9 MB in the beginning and 414.9 MB in the end (delta: -208.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1640 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6958 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1253; [L834] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1254; [L836] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1255; [L838] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1256; [L840] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L769] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L775] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L862] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 667 SDtfs, 719 SDslu, 1264 SDs, 0 SdLazy, 426 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 684 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 29354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...