/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:28:01,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:28:01,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:28:01,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:28:01,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:28:01,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:28:01,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:28:01,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:28:01,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:28:01,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:28:01,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:28:01,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:28:01,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:28:01,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:28:01,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:28:01,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:28:01,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:28:01,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:28:01,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:28:01,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:28:01,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:28:01,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:28:01,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:28:01,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:28:01,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:28:01,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:28:01,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:28:01,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:28:01,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:28:01,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:28:01,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:28:01,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:28:01,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:28:01,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:28:01,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:28:01,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:28:01,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:28:01,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:28:01,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:28:01,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:28:01,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:28:01,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 12:28:01,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:28:01,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:28:01,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:28:01,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:28:01,698 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:28:01,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:28:01,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:28:01,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:28:01,699 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:28:01,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:28:01,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:28:01,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:28:01,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:28:01,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:28:01,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:28:01,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:28:01,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:28:01,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:28:01,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:28:01,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:28:01,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:28:01,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:28:01,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:28:01,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:28:01,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:28:01,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:28:02,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:28:02,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:28:02,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:28:02,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:28:02,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-27 12:28:02,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c3be97/49d71867565d464f9d6ac557f0255714/FLAGbb41bbfb6 [2019-12-27 12:28:02,616 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:28:02,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.opt.i [2019-12-27 12:28:02,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c3be97/49d71867565d464f9d6ac557f0255714/FLAGbb41bbfb6 [2019-12-27 12:28:02,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657c3be97/49d71867565d464f9d6ac557f0255714 [2019-12-27 12:28:02,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:28:02,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:28:02,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:28:02,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:28:02,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:28:02,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:28:02" (1/1) ... [2019-12-27 12:28:02,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:02, skipping insertion in model container [2019-12-27 12:28:02,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:28:02" (1/1) ... [2019-12-27 12:28:02,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:28:03,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:28:03,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:28:03,466 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:28:03,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:28:03,620 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:28:03,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03 WrapperNode [2019-12-27 12:28:03,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:28:03,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:28:03,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:28:03,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:28:03,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:28:03,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:28:03,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:28:03,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:28:03,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (1/1) ... [2019-12-27 12:28:03,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:28:03,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:28:03,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:28:03,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:28:03,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (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 [2019-12-27 12:28:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:28:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:28:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:28:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:28:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:28:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:28:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:28:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:28:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:28:03,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:28:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:28:03,806 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:28:04,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:28:04,514 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:28:04,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:28:04 BoogieIcfgContainer [2019-12-27 12:28:04,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:28:04,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:28:04,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:28:04,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:28:04,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:28:02" (1/3) ... [2019-12-27 12:28:04,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:28:04, skipping insertion in model container [2019-12-27 12:28:04,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:28:03" (2/3) ... [2019-12-27 12:28:04,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56017124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:28:04, skipping insertion in model container [2019-12-27 12:28:04,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:28:04" (3/3) ... [2019-12-27 12:28:04,526 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.opt.i [2019-12-27 12:28:04,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:28:04,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:28:04,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:28:04,550 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:28:04,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,670 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:28:04,704 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:28:04,726 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:28:04,726 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:28:04,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:28:04,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:28:04,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:28:04,726 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:28:04,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:28:04,727 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:28:04,741 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-27 12:28:07,197 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-12-27 12:28:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-12-27 12:28:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 12:28:07,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:07,207 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:07,207 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash -334571497, now seen corresponding path program 1 times [2019-12-27 12:28:07,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:07,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665234178] [2019-12-27 12:28:07,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665234178] [2019-12-27 12:28:07,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:07,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275748011] [2019-12-27 12:28:07,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:07,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:07,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:07,548 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-12-27 12:28:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:09,257 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-12-27 12:28:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:28:09,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 12:28:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:09,561 INFO L225 Difference]: With dead ends: 33590 [2019-12-27 12:28:09,562 INFO L226 Difference]: Without dead ends: 25702 [2019-12-27 12:28:09,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-12-27 12:28:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-12-27 12:28:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-12-27 12:28:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-12-27 12:28:12,060 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-12-27 12:28:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:12,061 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-12-27 12:28:12,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-12-27 12:28:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 12:28:12,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:12,077 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:12,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1021806200, now seen corresponding path program 1 times [2019-12-27 12:28:12,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:12,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073603846] [2019-12-27 12:28:12,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:12,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073603846] [2019-12-27 12:28:12,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:12,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:12,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136162123] [2019-12-27 12:28:12,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:12,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:12,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:12,247 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-12-27 12:28:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:13,436 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-12-27 12:28:13,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:28:13,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 12:28:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:13,618 INFO L225 Difference]: With dead ends: 41080 [2019-12-27 12:28:13,618 INFO L226 Difference]: Without dead ends: 40544 [2019-12-27 12:28:13,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:28:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-12-27 12:28:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-12-27 12:28:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-12-27 12:28:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-12-27 12:28:16,258 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-12-27 12:28:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:16,260 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-12-27 12:28:16,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-12-27 12:28:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 12:28:16,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:16,266 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:16,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -169129071, now seen corresponding path program 1 times [2019-12-27 12:28:16,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:16,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879836075] [2019-12-27 12:28:16,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:16,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879836075] [2019-12-27 12:28:16,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:16,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:16,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448281795] [2019-12-27 12:28:16,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:16,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:16,381 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-12-27 12:28:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:17,294 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-12-27 12:28:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:28:17,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 12:28:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:17,519 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 12:28:17,520 INFO L226 Difference]: Without dead ends: 49273 [2019-12-27 12:28:17,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:28:17,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-12-27 12:28:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-12-27 12:28:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-12-27 12:28:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-12-27 12:28:20,435 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-12-27 12:28:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:20,435 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-12-27 12:28:20,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-12-27 12:28:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 12:28:20,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:20,444 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:20,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:20,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1646950391, now seen corresponding path program 1 times [2019-12-27 12:28:20,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:20,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957839686] [2019-12-27 12:28:20,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:20,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957839686] [2019-12-27 12:28:20,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:20,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:28:20,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166316389] [2019-12-27 12:28:20,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:28:20,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:28:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:20,492 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-12-27 12:28:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:21,112 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-12-27 12:28:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:28:21,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-27 12:28:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:21,328 INFO L225 Difference]: With dead ends: 61086 [2019-12-27 12:28:21,328 INFO L226 Difference]: Without dead ends: 61086 [2019-12-27 12:28:21,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-12-27 12:28:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-12-27 12:28:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-12-27 12:28:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-12-27 12:28:24,402 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-12-27 12:28:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:24,403 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-12-27 12:28:24,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:28:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-12-27 12:28:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 12:28:24,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:24,418 INFO L411 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, 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] [2019-12-27 12:28:24,419 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2087627749, now seen corresponding path program 1 times [2019-12-27 12:28:24,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:24,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109063173] [2019-12-27 12:28:24,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:24,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109063173] [2019-12-27 12:28:24,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:24,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:24,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582951133] [2019-12-27 12:28:24,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:24,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:24,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:24,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:24,589 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-12-27 12:28:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:25,895 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-12-27 12:28:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:28:25,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 12:28:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:26,083 INFO L225 Difference]: With dead ends: 63755 [2019-12-27 12:28:26,083 INFO L226 Difference]: Without dead ends: 63755 [2019-12-27 12:28:26,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:28:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-12-27 12:28:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-12-27 12:28:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-12-27 12:28:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-12-27 12:28:29,247 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-12-27 12:28:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:29,248 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-12-27 12:28:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-12-27 12:28:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 12:28:29,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:29,266 INFO L411 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, 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] [2019-12-27 12:28:29,267 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:29,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:29,267 INFO L82 PathProgramCache]: Analyzing trace with hash 290676390, now seen corresponding path program 1 times [2019-12-27 12:28:29,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:29,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936504776] [2019-12-27 12:28:29,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936504776] [2019-12-27 12:28:29,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:29,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:28:29,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570793377] [2019-12-27 12:28:29,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:28:29,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:28:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:29,391 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-12-27 12:28:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:31,307 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-12-27 12:28:31,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:28:31,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 12:28:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:31,480 INFO L225 Difference]: With dead ends: 83684 [2019-12-27 12:28:31,480 INFO L226 Difference]: Without dead ends: 83684 [2019-12-27 12:28:31,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:28:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-12-27 12:28:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-12-27 12:28:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-12-27 12:28:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-12-27 12:28:35,238 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-12-27 12:28:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:35,238 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-12-27 12:28:35,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:28:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-12-27 12:28:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 12:28:35,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:35,252 INFO L411 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, 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] [2019-12-27 12:28:35,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:35,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180071, now seen corresponding path program 1 times [2019-12-27 12:28:35,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:35,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316729602] [2019-12-27 12:28:35,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:35,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316729602] [2019-12-27 12:28:35,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:35,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:28:35,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774306416] [2019-12-27 12:28:35,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:28:35,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:35,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:28:35,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:35,310 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-12-27 12:28:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:35,556 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-12-27 12:28:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:28:35,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 12:28:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:35,667 INFO L225 Difference]: With dead ends: 54020 [2019-12-27 12:28:35,667 INFO L226 Difference]: Without dead ends: 54020 [2019-12-27 12:28:35,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-12-27 12:28:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-12-27 12:28:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-12-27 12:28:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-12-27 12:28:37,168 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-12-27 12:28:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:37,168 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-12-27 12:28:37,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:28:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-12-27 12:28:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 12:28:37,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:37,177 INFO L411 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, 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] [2019-12-27 12:28:37,178 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1257036994, now seen corresponding path program 1 times [2019-12-27 12:28:37,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:37,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960593888] [2019-12-27 12:28:37,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:37,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960593888] [2019-12-27 12:28:37,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:37,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:37,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750857904] [2019-12-27 12:28:37,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:37,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:37,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:37,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:37,241 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-12-27 12:28:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:38,657 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-12-27 12:28:38,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:28:38,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 12:28:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:38,812 INFO L225 Difference]: With dead ends: 68645 [2019-12-27 12:28:38,813 INFO L226 Difference]: Without dead ends: 68077 [2019-12-27 12:28:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:28:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-12-27 12:28:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-12-27 12:28:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-12-27 12:28:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-12-27 12:28:39,882 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-12-27 12:28:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:39,883 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-12-27 12:28:39,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-12-27 12:28:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:28:39,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:39,894 INFO L411 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, 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] [2019-12-27 12:28:39,894 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2126518202, now seen corresponding path program 1 times [2019-12-27 12:28:39,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:39,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430530148] [2019-12-27 12:28:39,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:40,447 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 12:28:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:40,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430530148] [2019-12-27 12:28:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:40,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382227772] [2019-12-27 12:28:40,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:40,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:40,480 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-12-27 12:28:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:41,298 INFO L93 Difference]: Finished difference Result 67848 states and 231359 transitions. [2019-12-27 12:28:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:28:41,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 12:28:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:41,437 INFO L225 Difference]: With dead ends: 67848 [2019-12-27 12:28:41,437 INFO L226 Difference]: Without dead ends: 67848 [2019-12-27 12:28:41,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:28:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67848 states. [2019-12-27 12:28:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67848 to 59080. [2019-12-27 12:28:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59080 states. [2019-12-27 12:28:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59080 states to 59080 states and 204129 transitions. [2019-12-27 12:28:44,979 INFO L78 Accepts]: Start accepts. Automaton has 59080 states and 204129 transitions. Word has length 53 [2019-12-27 12:28:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:44,979 INFO L462 AbstractCegarLoop]: Abstraction has 59080 states and 204129 transitions. [2019-12-27 12:28:44,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 59080 states and 204129 transitions. [2019-12-27 12:28:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 12:28:44,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:44,990 INFO L411 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, 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] [2019-12-27 12:28:44,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1239014521, now seen corresponding path program 1 times [2019-12-27 12:28:44,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:44,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220488985] [2019-12-27 12:28:44,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:45,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220488985] [2019-12-27 12:28:45,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:45,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:45,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331476349] [2019-12-27 12:28:45,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:45,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:45,067 INFO L87 Difference]: Start difference. First operand 59080 states and 204129 transitions. Second operand 4 states. [2019-12-27 12:28:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:45,131 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-12-27 12:28:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:28:45,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 12:28:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:45,149 INFO L225 Difference]: With dead ends: 10211 [2019-12-27 12:28:45,149 INFO L226 Difference]: Without dead ends: 8506 [2019-12-27 12:28:45,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-12-27 12:28:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-12-27 12:28:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-12-27 12:28:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-12-27 12:28:45,276 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-12-27 12:28:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:45,277 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-12-27 12:28:45,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-12-27 12:28:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 12:28:45,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:45,281 INFO L411 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:45,281 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:45,282 INFO L82 PathProgramCache]: Analyzing trace with hash -575967074, now seen corresponding path program 1 times [2019-12-27 12:28:45,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:45,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63309239] [2019-12-27 12:28:45,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:45,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63309239] [2019-12-27 12:28:45,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:45,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:45,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484273121] [2019-12-27 12:28:45,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:45,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:45,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:45,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:45,349 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-12-27 12:28:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:45,494 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-12-27 12:28:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:28:45,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-27 12:28:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:45,515 INFO L225 Difference]: With dead ends: 9705 [2019-12-27 12:28:45,515 INFO L226 Difference]: Without dead ends: 9705 [2019-12-27 12:28:45,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-12-27 12:28:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-12-27 12:28:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 12:28:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-12-27 12:28:45,735 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-12-27 12:28:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:45,736 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-12-27 12:28:45,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-12-27 12:28:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 12:28:45,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:45,741 INFO L411 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:45,741 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843261, now seen corresponding path program 1 times [2019-12-27 12:28:45,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:45,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712297810] [2019-12-27 12:28:45,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:45,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712297810] [2019-12-27 12:28:45,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:45,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:45,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952548918] [2019-12-27 12:28:45,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:45,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:45,841 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-12-27 12:28:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:46,280 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-12-27 12:28:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:28:46,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 12:28:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:46,304 INFO L225 Difference]: With dead ends: 11194 [2019-12-27 12:28:46,304 INFO L226 Difference]: Without dead ends: 11133 [2019-12-27 12:28:46,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:28:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-12-27 12:28:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-12-27 12:28:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-12-27 12:28:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-12-27 12:28:46,495 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-12-27 12:28:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:46,495 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-12-27 12:28:46,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-12-27 12:28:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:46,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:46,501 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:46,501 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash -45860868, now seen corresponding path program 1 times [2019-12-27 12:28:46,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:46,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317054892] [2019-12-27 12:28:46,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:46,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317054892] [2019-12-27 12:28:46,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:46,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:46,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939225474] [2019-12-27 12:28:46,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:46,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:46,559 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 4 states. [2019-12-27 12:28:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:46,837 INFO L93 Difference]: Finished difference Result 13382 states and 39332 transitions. [2019-12-27 12:28:46,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:28:46,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 12:28:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:46,855 INFO L225 Difference]: With dead ends: 13382 [2019-12-27 12:28:46,856 INFO L226 Difference]: Without dead ends: 13382 [2019-12-27 12:28:46,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:46,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-12-27 12:28:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 11723. [2019-12-27 12:28:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-12-27 12:28:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 34576 transitions. [2019-12-27 12:28:47,012 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 34576 transitions. Word has length 66 [2019-12-27 12:28:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:47,012 INFO L462 AbstractCegarLoop]: Abstraction has 11723 states and 34576 transitions. [2019-12-27 12:28:47,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 34576 transitions. [2019-12-27 12:28:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:47,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:47,019 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:47,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash 915753149, now seen corresponding path program 1 times [2019-12-27 12:28:47,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:47,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578293421] [2019-12-27 12:28:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:47,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578293421] [2019-12-27 12:28:47,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:47,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:47,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287284509] [2019-12-27 12:28:47,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:47,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:47,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:47,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:47,111 INFO L87 Difference]: Start difference. First operand 11723 states and 34576 transitions. Second operand 6 states. [2019-12-27 12:28:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:47,908 INFO L93 Difference]: Finished difference Result 12872 states and 37333 transitions. [2019-12-27 12:28:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:28:47,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 12:28:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:47,925 INFO L225 Difference]: With dead ends: 12872 [2019-12-27 12:28:47,925 INFO L226 Difference]: Without dead ends: 12872 [2019-12-27 12:28:47,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:28:47,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-12-27 12:28:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 12572. [2019-12-27 12:28:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12572 states. [2019-12-27 12:28:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12572 states to 12572 states and 36575 transitions. [2019-12-27 12:28:48,087 INFO L78 Accepts]: Start accepts. Automaton has 12572 states and 36575 transitions. Word has length 66 [2019-12-27 12:28:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:48,087 INFO L462 AbstractCegarLoop]: Abstraction has 12572 states and 36575 transitions. [2019-12-27 12:28:48,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 12572 states and 36575 transitions. [2019-12-27 12:28:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:48,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:48,095 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:48,095 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1608854846, now seen corresponding path program 1 times [2019-12-27 12:28:48,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:48,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565570434] [2019-12-27 12:28:48,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:48,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565570434] [2019-12-27 12:28:48,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:48,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:28:48,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945681076] [2019-12-27 12:28:48,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:28:48,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:28:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:28:48,196 INFO L87 Difference]: Start difference. First operand 12572 states and 36575 transitions. Second operand 6 states. [2019-12-27 12:28:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:48,678 INFO L93 Difference]: Finished difference Result 14461 states and 40823 transitions. [2019-12-27 12:28:48,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:28:48,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 12:28:48,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:48,699 INFO L225 Difference]: With dead ends: 14461 [2019-12-27 12:28:48,699 INFO L226 Difference]: Without dead ends: 14461 [2019-12-27 12:28:48,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:28:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-12-27 12:28:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 13135. [2019-12-27 12:28:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-12-27 12:28:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 37544 transitions. [2019-12-27 12:28:48,876 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 37544 transitions. Word has length 66 [2019-12-27 12:28:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:48,876 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 37544 transitions. [2019-12-27 12:28:48,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:28:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 37544 transitions. [2019-12-27 12:28:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:48,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:48,884 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:48,884 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash -468354497, now seen corresponding path program 1 times [2019-12-27 12:28:48,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:48,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198227079] [2019-12-27 12:28:48,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:48,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198227079] [2019-12-27 12:28:48,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:48,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:48,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674652593] [2019-12-27 12:28:48,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:48,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:48,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:48,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:48,969 INFO L87 Difference]: Start difference. First operand 13135 states and 37544 transitions. Second operand 5 states. [2019-12-27 12:28:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:49,345 INFO L93 Difference]: Finished difference Result 16961 states and 48256 transitions. [2019-12-27 12:28:49,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:28:49,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 12:28:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:49,371 INFO L225 Difference]: With dead ends: 16961 [2019-12-27 12:28:49,371 INFO L226 Difference]: Without dead ends: 16961 [2019-12-27 12:28:49,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2019-12-27 12:28:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 15665. [2019-12-27 12:28:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15665 states. [2019-12-27 12:28:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15665 states to 15665 states and 44441 transitions. [2019-12-27 12:28:49,580 INFO L78 Accepts]: Start accepts. Automaton has 15665 states and 44441 transitions. Word has length 66 [2019-12-27 12:28:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:49,580 INFO L462 AbstractCegarLoop]: Abstraction has 15665 states and 44441 transitions. [2019-12-27 12:28:49,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 15665 states and 44441 transitions. [2019-12-27 12:28:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:49,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:49,590 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:49,590 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash -978888674, now seen corresponding path program 1 times [2019-12-27 12:28:49,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:49,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127464202] [2019-12-27 12:28:49,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:49,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127464202] [2019-12-27 12:28:49,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:49,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231765262] [2019-12-27 12:28:49,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:49,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:49,642 INFO L87 Difference]: Start difference. First operand 15665 states and 44441 transitions. Second operand 4 states. [2019-12-27 12:28:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:50,194 INFO L93 Difference]: Finished difference Result 19289 states and 54888 transitions. [2019-12-27 12:28:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:28:50,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 12:28:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:50,219 INFO L225 Difference]: With dead ends: 19289 [2019-12-27 12:28:50,220 INFO L226 Difference]: Without dead ends: 19112 [2019-12-27 12:28:50,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19112 states. [2019-12-27 12:28:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19112 to 18239. [2019-12-27 12:28:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18239 states. [2019-12-27 12:28:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18239 states to 18239 states and 51794 transitions. [2019-12-27 12:28:50,809 INFO L78 Accepts]: Start accepts. Automaton has 18239 states and 51794 transitions. Word has length 66 [2019-12-27 12:28:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:50,809 INFO L462 AbstractCegarLoop]: Abstraction has 18239 states and 51794 transitions. [2019-12-27 12:28:50,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18239 states and 51794 transitions. [2019-12-27 12:28:50,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:50,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:50,817 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:50,817 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:50,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127263, now seen corresponding path program 1 times [2019-12-27 12:28:50,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:50,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811794086] [2019-12-27 12:28:50,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:50,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811794086] [2019-12-27 12:28:50,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:50,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 12:28:50,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033009995] [2019-12-27 12:28:50,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 12:28:50,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 12:28:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:28:50,965 INFO L87 Difference]: Start difference. First operand 18239 states and 51794 transitions. Second operand 9 states. [2019-12-27 12:28:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:51,972 INFO L93 Difference]: Finished difference Result 24689 states and 69797 transitions. [2019-12-27 12:28:51,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 12:28:51,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 12:28:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:52,005 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 12:28:52,005 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 12:28:52,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:28:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 12:28:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 21314. [2019-12-27 12:28:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21314 states. [2019-12-27 12:28:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21314 states to 21314 states and 60247 transitions. [2019-12-27 12:28:52,283 INFO L78 Accepts]: Start accepts. Automaton has 21314 states and 60247 transitions. Word has length 66 [2019-12-27 12:28:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:52,284 INFO L462 AbstractCegarLoop]: Abstraction has 21314 states and 60247 transitions. [2019-12-27 12:28:52,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 12:28:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21314 states and 60247 transitions. [2019-12-27 12:28:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:52,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:52,291 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:52,291 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:52,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:52,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1888336352, now seen corresponding path program 1 times [2019-12-27 12:28:52,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:52,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575011188] [2019-12-27 12:28:52,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:52,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575011188] [2019-12-27 12:28:52,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:52,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:52,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296867238] [2019-12-27 12:28:52,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:52,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:52,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:52,369 INFO L87 Difference]: Start difference. First operand 21314 states and 60247 transitions. Second operand 5 states. [2019-12-27 12:28:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:52,422 INFO L93 Difference]: Finished difference Result 6356 states and 15007 transitions. [2019-12-27 12:28:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:28:52,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 12:28:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:52,430 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 12:28:52,431 INFO L226 Difference]: Without dead ends: 5396 [2019-12-27 12:28:52,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2019-12-27 12:28:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4648. [2019-12-27 12:28:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4648 states. [2019-12-27 12:28:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 10675 transitions. [2019-12-27 12:28:52,502 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 10675 transitions. Word has length 66 [2019-12-27 12:28:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:52,502 INFO L462 AbstractCegarLoop]: Abstraction has 4648 states and 10675 transitions. [2019-12-27 12:28:52,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 10675 transitions. [2019-12-27 12:28:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 12:28:52,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:52,508 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:52,508 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1090796306, now seen corresponding path program 1 times [2019-12-27 12:28:52,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:52,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849868096] [2019-12-27 12:28:52,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:52,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849868096] [2019-12-27 12:28:52,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:52,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:28:52,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829595775] [2019-12-27 12:28:52,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:28:52,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:52,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:28:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:52,543 INFO L87 Difference]: Start difference. First operand 4648 states and 10675 transitions. Second operand 3 states. [2019-12-27 12:28:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:52,576 INFO L93 Difference]: Finished difference Result 5729 states and 12974 transitions. [2019-12-27 12:28:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:28:52,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 12:28:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:52,585 INFO L225 Difference]: With dead ends: 5729 [2019-12-27 12:28:52,585 INFO L226 Difference]: Without dead ends: 5729 [2019-12-27 12:28:52,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:28:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2019-12-27 12:28:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 4571. [2019-12-27 12:28:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2019-12-27 12:28:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 10222 transitions. [2019-12-27 12:28:52,661 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 10222 transitions. Word has length 66 [2019-12-27 12:28:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:52,661 INFO L462 AbstractCegarLoop]: Abstraction has 4571 states and 10222 transitions. [2019-12-27 12:28:52,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:28:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 10222 transitions. [2019-12-27 12:28:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 12:28:52,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:52,667 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:52,667 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2889151, now seen corresponding path program 1 times [2019-12-27 12:28:52,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:52,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364556012] [2019-12-27 12:28:52,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:52,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364556012] [2019-12-27 12:28:52,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:52,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:52,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888645763] [2019-12-27 12:28:52,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:52,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:52,734 INFO L87 Difference]: Start difference. First operand 4571 states and 10222 transitions. Second operand 5 states. [2019-12-27 12:28:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:52,922 INFO L93 Difference]: Finished difference Result 5642 states and 12670 transitions. [2019-12-27 12:28:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:28:52,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-27 12:28:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:52,930 INFO L225 Difference]: With dead ends: 5642 [2019-12-27 12:28:52,930 INFO L226 Difference]: Without dead ends: 5642 [2019-12-27 12:28:52,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:28:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-27 12:28:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 4991. [2019-12-27 12:28:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4991 states. [2019-12-27 12:28:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 11180 transitions. [2019-12-27 12:28:52,982 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 11180 transitions. Word has length 72 [2019-12-27 12:28:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:52,982 INFO L462 AbstractCegarLoop]: Abstraction has 4991 states and 11180 transitions. [2019-12-27 12:28:52,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 11180 transitions. [2019-12-27 12:28:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 12:28:52,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:52,987 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:52,987 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1739921184, now seen corresponding path program 1 times [2019-12-27 12:28:52,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:52,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269835872] [2019-12-27 12:28:52,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:53,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269835872] [2019-12-27 12:28:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:53,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:28:53,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115839280] [2019-12-27 12:28:53,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:28:53,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:53,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:28:53,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:53,061 INFO L87 Difference]: Start difference. First operand 4991 states and 11180 transitions. Second operand 7 states. [2019-12-27 12:28:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:53,528 INFO L93 Difference]: Finished difference Result 5857 states and 13026 transitions. [2019-12-27 12:28:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:28:53,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-27 12:28:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:53,536 INFO L225 Difference]: With dead ends: 5857 [2019-12-27 12:28:53,536 INFO L226 Difference]: Without dead ends: 5804 [2019-12-27 12:28:53,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 12:28:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-12-27 12:28:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5022. [2019-12-27 12:28:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5022 states. [2019-12-27 12:28:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 11180 transitions. [2019-12-27 12:28:53,588 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 11180 transitions. Word has length 72 [2019-12-27 12:28:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:53,588 INFO L462 AbstractCegarLoop]: Abstraction has 5022 states and 11180 transitions. [2019-12-27 12:28:53,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:28:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 11180 transitions. [2019-12-27 12:28:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 12:28:53,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:53,593 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:53,593 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1337768424, now seen corresponding path program 1 times [2019-12-27 12:28:53,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:53,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889167001] [2019-12-27 12:28:53,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:53,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889167001] [2019-12-27 12:28:53,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:53,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:53,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621539037] [2019-12-27 12:28:53,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:53,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:53,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:53,657 INFO L87 Difference]: Start difference. First operand 5022 states and 11180 transitions. Second operand 4 states. [2019-12-27 12:28:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:53,767 INFO L93 Difference]: Finished difference Result 6021 states and 13314 transitions. [2019-12-27 12:28:53,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:28:53,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-27 12:28:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:53,777 INFO L225 Difference]: With dead ends: 6021 [2019-12-27 12:28:53,777 INFO L226 Difference]: Without dead ends: 6021 [2019-12-27 12:28:53,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2019-12-27 12:28:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 5308. [2019-12-27 12:28:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5308 states. [2019-12-27 12:28:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 11804 transitions. [2019-12-27 12:28:53,868 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 11804 transitions. Word has length 93 [2019-12-27 12:28:53,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:53,869 INFO L462 AbstractCegarLoop]: Abstraction has 5308 states and 11804 transitions. [2019-12-27 12:28:53,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 11804 transitions. [2019-12-27 12:28:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:53,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:53,877 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:53,877 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1928051890, now seen corresponding path program 1 times [2019-12-27 12:28:53,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:53,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564319397] [2019-12-27 12:28:53,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:53,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564319397] [2019-12-27 12:28:53,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:53,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:28:53,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146896515] [2019-12-27 12:28:53,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:28:53,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:28:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:53,942 INFO L87 Difference]: Start difference. First operand 5308 states and 11804 transitions. Second operand 5 states. [2019-12-27 12:28:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:54,042 INFO L93 Difference]: Finished difference Result 5797 states and 12867 transitions. [2019-12-27 12:28:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:28:54,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 12:28:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:54,048 INFO L225 Difference]: With dead ends: 5797 [2019-12-27 12:28:54,048 INFO L226 Difference]: Without dead ends: 5797 [2019-12-27 12:28:54,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5797 states. [2019-12-27 12:28:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5797 to 4433. [2019-12-27 12:28:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4433 states. [2019-12-27 12:28:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 9850 transitions. [2019-12-27 12:28:54,097 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 9850 transitions. Word has length 95 [2019-12-27 12:28:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:54,097 INFO L462 AbstractCegarLoop]: Abstraction has 4433 states and 9850 transitions. [2019-12-27 12:28:54,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:28:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 9850 transitions. [2019-12-27 12:28:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:54,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:54,101 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:54,101 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:54,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1916735763, now seen corresponding path program 1 times [2019-12-27 12:28:54,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:54,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580324560] [2019-12-27 12:28:54,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:54,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580324560] [2019-12-27 12:28:54,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:54,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:54,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137527763] [2019-12-27 12:28:54,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:54,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:54,167 INFO L87 Difference]: Start difference. First operand 4433 states and 9850 transitions. Second operand 4 states. [2019-12-27 12:28:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:54,258 INFO L93 Difference]: Finished difference Result 4864 states and 10817 transitions. [2019-12-27 12:28:54,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:28:54,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 12:28:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:54,265 INFO L225 Difference]: With dead ends: 4864 [2019-12-27 12:28:54,265 INFO L226 Difference]: Without dead ends: 4864 [2019-12-27 12:28:54,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2019-12-27 12:28:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4504. [2019-12-27 12:28:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-12-27 12:28:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 10001 transitions. [2019-12-27 12:28:54,311 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 10001 transitions. Word has length 95 [2019-12-27 12:28:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:54,312 INFO L462 AbstractCegarLoop]: Abstraction has 4504 states and 10001 transitions. [2019-12-27 12:28:54,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 10001 transitions. [2019-12-27 12:28:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:54,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:54,317 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:54,317 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash 70745997, now seen corresponding path program 1 times [2019-12-27 12:28:54,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:54,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874400518] [2019-12-27 12:28:54,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:54,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874400518] [2019-12-27 12:28:54,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:54,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:28:54,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669993014] [2019-12-27 12:28:54,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:28:54,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:54,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:28:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:28:54,563 INFO L87 Difference]: Start difference. First operand 4504 states and 10001 transitions. Second operand 4 states. [2019-12-27 12:28:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:54,807 INFO L93 Difference]: Finished difference Result 5732 states and 12656 transitions. [2019-12-27 12:28:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:28:54,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 12:28:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:54,820 INFO L225 Difference]: With dead ends: 5732 [2019-12-27 12:28:54,820 INFO L226 Difference]: Without dead ends: 5680 [2019-12-27 12:28:54,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:28:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2019-12-27 12:28:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5377. [2019-12-27 12:28:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5377 states. [2019-12-27 12:28:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5377 states to 5377 states and 11898 transitions. [2019-12-27 12:28:54,899 INFO L78 Accepts]: Start accepts. Automaton has 5377 states and 11898 transitions. Word has length 95 [2019-12-27 12:28:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:54,900 INFO L462 AbstractCegarLoop]: Abstraction has 5377 states and 11898 transitions. [2019-12-27 12:28:54,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:28:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5377 states and 11898 transitions. [2019-12-27 12:28:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:54,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:54,907 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:54,907 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 301022190, now seen corresponding path program 1 times [2019-12-27 12:28:54,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:54,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131476835] [2019-12-27 12:28:54,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131476835] [2019-12-27 12:28:54,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:54,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:28:54,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679603942] [2019-12-27 12:28:54,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:28:54,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:28:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:28:54,994 INFO L87 Difference]: Start difference. First operand 5377 states and 11898 transitions. Second operand 7 states. [2019-12-27 12:28:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:55,404 INFO L93 Difference]: Finished difference Result 7207 states and 15907 transitions. [2019-12-27 12:28:55,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 12:28:55,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 12:28:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:55,415 INFO L225 Difference]: With dead ends: 7207 [2019-12-27 12:28:55,415 INFO L226 Difference]: Without dead ends: 7207 [2019-12-27 12:28:55,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 12:28:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2019-12-27 12:28:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 6478. [2019-12-27 12:28:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-12-27 12:28:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 14325 transitions. [2019-12-27 12:28:55,496 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 14325 transitions. Word has length 95 [2019-12-27 12:28:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:55,497 INFO L462 AbstractCegarLoop]: Abstraction has 6478 states and 14325 transitions. [2019-12-27 12:28:55,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:28:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 14325 transitions. [2019-12-27 12:28:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:55,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:55,506 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:55,507 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:55,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2006463346, now seen corresponding path program 1 times [2019-12-27 12:28:55,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:55,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255574139] [2019-12-27 12:28:55,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:55,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255574139] [2019-12-27 12:28:55,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:55,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 12:28:55,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854873278] [2019-12-27 12:28:55,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 12:28:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:55,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 12:28:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 12:28:55,769 INFO L87 Difference]: Start difference. First operand 6478 states and 14325 transitions. Second operand 13 states. [2019-12-27 12:28:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:57,428 INFO L93 Difference]: Finished difference Result 9647 states and 20909 transitions. [2019-12-27 12:28:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 12:28:57,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-27 12:28:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:57,444 INFO L225 Difference]: With dead ends: 9647 [2019-12-27 12:28:57,445 INFO L226 Difference]: Without dead ends: 9647 [2019-12-27 12:28:57,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-27 12:28:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9647 states. [2019-12-27 12:28:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9647 to 7371. [2019-12-27 12:28:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7371 states. [2019-12-27 12:28:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 16263 transitions. [2019-12-27 12:28:57,626 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 16263 transitions. Word has length 95 [2019-12-27 12:28:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:57,627 INFO L462 AbstractCegarLoop]: Abstraction has 7371 states and 16263 transitions. [2019-12-27 12:28:57,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 12:28:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 16263 transitions. [2019-12-27 12:28:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:57,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:57,639 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:57,639 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:57,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash -907608752, now seen corresponding path program 1 times [2019-12-27 12:28:57,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:57,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204095909] [2019-12-27 12:28:57,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:28:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:28:57,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204095909] [2019-12-27 12:28:57,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:28:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 12:28:57,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80760385] [2019-12-27 12:28:57,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 12:28:57,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:28:57,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 12:28:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:28:57,830 INFO L87 Difference]: Start difference. First operand 7371 states and 16263 transitions. Second operand 10 states. [2019-12-27 12:28:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:28:58,359 INFO L93 Difference]: Finished difference Result 21781 states and 48597 transitions. [2019-12-27 12:28:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 12:28:58,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-27 12:28:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:28:58,382 INFO L225 Difference]: With dead ends: 21781 [2019-12-27 12:28:58,382 INFO L226 Difference]: Without dead ends: 14413 [2019-12-27 12:28:58,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-27 12:28:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14413 states. [2019-12-27 12:28:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14413 to 7181. [2019-12-27 12:28:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7181 states. [2019-12-27 12:28:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7181 states to 7181 states and 15781 transitions. [2019-12-27 12:28:58,517 INFO L78 Accepts]: Start accepts. Automaton has 7181 states and 15781 transitions. Word has length 95 [2019-12-27 12:28:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:28:58,517 INFO L462 AbstractCegarLoop]: Abstraction has 7181 states and 15781 transitions. [2019-12-27 12:28:58,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 12:28:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7181 states and 15781 transitions. [2019-12-27 12:28:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:28:58,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:28:58,524 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 12:28:58,524 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:28:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:28:58,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1770172980, now seen corresponding path program 2 times [2019-12-27 12:28:58,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:28:58,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241132394] [2019-12-27 12:28:58,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:28:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:28:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:28:58,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:28:58,609 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:28:58,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:28:58 BasicIcfg [2019-12-27 12:28:58,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:28:58,767 INFO L168 Benchmark]: Toolchain (without parser) took 55829.70 ms. Allocated memory was 144.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 100.3 MB in the beginning and 995.2 MB in the end (delta: -894.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,767 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.46 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.91 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,768 INFO L168 Benchmark]: Boogie Preprocessor took 37.21 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,769 INFO L168 Benchmark]: RCFGBuilder took 796.29 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 106.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,770 INFO L168 Benchmark]: TraceAbstraction took 54247.34 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.1 MB in the beginning and 995.2 MB in the end (delta: -889.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 12:28:58,772 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 682.46 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.91 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.21 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 150.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 796.29 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 106.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54247.34 ms. Allocated memory was 200.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.1 MB in the beginning and 995.2 MB in the end (delta: -889.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1443; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1443, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1444; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1444, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.8s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8020 SDtfs, 8461 SDslu, 20118 SDs, 0 SdLazy, 8624 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 88483 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 328986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...