/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/rfi004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:55:12,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:55:12,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:55:12,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:55:12,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:55:12,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:55:12,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:55:12,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:55:12,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:55:12,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:55:12,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:55:12,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:55:12,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:55:12,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:55:12,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:55:12,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:55:12,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:55:12,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:55:12,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:55:12,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:55:12,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:55:12,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:55:12,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:55:12,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:55:12,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:55:12,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:55:12,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:55:12,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:55:12,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:55:12,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:55:12,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:55:12,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:55:12,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:55:12,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:55:12,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:55:12,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:55:12,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:55:12,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:55:12,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:55:12,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:55:12,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:55:12,669 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:55:12,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:55:12,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:55:12,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:55:12,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:55:12,686 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:55:12,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:55:12,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:55:12,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:55:12,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:55:12,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:55:12,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:55:12,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:55:12,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:55:12,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:55:12,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:55:12,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:55:12,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:55:12,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:55:12,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:55:12,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:55:12,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:55:12,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:55:12,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:55:12,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:55:12,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:55:13,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:55:13,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:55:13,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:55:13,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:55:13,025 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:55:13,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 12:55:13,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490c64e7a/1defad890df84e5c8640b6c9f76dcd09/FLAG8ee0aa682 [2019-12-27 12:55:13,649 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:55:13,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 12:55:13,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490c64e7a/1defad890df84e5c8640b6c9f76dcd09/FLAG8ee0aa682 [2019-12-27 12:55:13,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490c64e7a/1defad890df84e5c8640b6c9f76dcd09 [2019-12-27 12:55:13,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:55:13,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:55:13,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:55:13,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:55:13,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:55:13,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:55:13" (1/1) ... [2019-12-27 12:55:13,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2651ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:13, skipping insertion in model container [2019-12-27 12:55:13,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:55:13" (1/1) ... [2019-12-27 12:55:13,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:55:13,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:55:14,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:55:14,537 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:55:14,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:55:14,673 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:55:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14 WrapperNode [2019-12-27 12:55:14,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:55:14,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:55:14,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:55:14,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:55:14,683 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:55:14" (1/1) ... [2019-12-27 12:55:14,719 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:55:14" (1/1) ... [2019-12-27 12:55:14,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:55:14,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:55:14,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:55:14,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:55:14,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (1/1) ... [2019-12-27 12:55:14,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:55:14,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:55:14,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:55:14,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:55:14,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (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:55:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:55:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:55:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:55:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:55:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:55:14,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:55:14,853 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:55:14,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:55:14,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:55:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:55:14,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:55:14,859 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:55:15,548 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:55:15,549 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:55:15,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:55:15 BoogieIcfgContainer [2019-12-27 12:55:15,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:55:15,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:55:15,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:55:15,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:55:15,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:55:13" (1/3) ... [2019-12-27 12:55:15,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643353e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:55:15, skipping insertion in model container [2019-12-27 12:55:15,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:55:14" (2/3) ... [2019-12-27 12:55:15,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643353e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:55:15, skipping insertion in model container [2019-12-27 12:55:15,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:55:15" (3/3) ... [2019-12-27 12:55:15,558 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-12-27 12:55:15,567 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:55:15,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:55:15,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:55:15,576 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:55:15,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,614 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,639 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,641 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,651 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,652 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,658 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:55:15,679 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:55:15,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:55:15,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:55:15,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:55:15,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:55:15,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:55:15,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:55:15,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:55:15,702 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:55:15,716 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-27 12:55:17,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-27 12:55:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-27 12:55:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 12:55:17,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:17,467 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] [2019-12-27 12:55:17,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-27 12:55:17,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:17,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913456171] [2019-12-27 12:55:17,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:17,823 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:55:17,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913456171] [2019-12-27 12:55:17,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:17,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:17,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626958537] [2019-12-27 12:55:17,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:17,850 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-27 12:55:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:19,243 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-27 12:55:19,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:55:19,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 12:55:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:19,456 INFO L225 Difference]: With dead ends: 26617 [2019-12-27 12:55:19,457 INFO L226 Difference]: Without dead ends: 20361 [2019-12-27 12:55:19,458 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:55:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-27 12:55:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-27 12:55:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-27 12:55:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-27 12:55:20,494 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-27 12:55:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:20,496 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-27 12:55:20,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-27 12:55:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 12:55:20,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:20,513 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:55:20,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-27 12:55:20,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:20,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28316701] [2019-12-27 12:55:20,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:20,698 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:55:20,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28316701] [2019-12-27 12:55:20,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:20,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:20,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512736777] [2019-12-27 12:55:20,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:20,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:20,702 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-27 12:55:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:21,663 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-27 12:55:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:21,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-27 12:55:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:21,811 INFO L225 Difference]: With dead ends: 31839 [2019-12-27 12:55:21,811 INFO L226 Difference]: Without dead ends: 31287 [2019-12-27 12:55:21,812 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:55:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-27 12:55:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-27 12:55:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-27 12:55:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-27 12:55:24,078 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-27 12:55:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:24,080 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-27 12:55:24,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-27 12:55:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 12:55:24,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:24,096 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] [2019-12-27 12:55:24,097 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-27 12:55:24,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:24,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623286753] [2019-12-27 12:55:24,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:24,190 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:55:24,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623286753] [2019-12-27 12:55:24,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:24,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:24,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358830371] [2019-12-27 12:55:24,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:24,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:24,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:24,193 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-27 12:55:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:24,724 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-27 12:55:24,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:24,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 12:55:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:24,976 INFO L225 Difference]: With dead ends: 38697 [2019-12-27 12:55:24,976 INFO L226 Difference]: Without dead ends: 38249 [2019-12-27 12:55:24,977 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:55:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-27 12:55:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-27 12:55:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-27 12:55:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-27 12:55:27,210 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-27 12:55:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:27,210 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-27 12:55:27,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-27 12:55:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 12:55:27,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:27,220 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] [2019-12-27 12:55:27,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-27 12:55:27,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:27,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140808985] [2019-12-27 12:55:27,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:27,263 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:55:27,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140808985] [2019-12-27 12:55:27,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:27,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:55:27,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105827291] [2019-12-27 12:55:27,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:55:27,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:55:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:55:27,266 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-27 12:55:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:27,715 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-27 12:55:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:55:27,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 12:55:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:27,847 INFO L225 Difference]: With dead ends: 42413 [2019-12-27 12:55:27,848 INFO L226 Difference]: Without dead ends: 42413 [2019-12-27 12:55:27,848 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:55:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-27 12:55:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-27 12:55:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-27 12:55:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-27 12:55:30,167 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-27 12:55:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:30,167 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-27 12:55:30,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:55:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-27 12:55:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:55:30,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:30,186 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] [2019-12-27 12:55:30,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-27 12:55:30,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:30,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423981284] [2019-12-27 12:55:30,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:30,326 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:55:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423981284] [2019-12-27 12:55:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:30,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:30,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778746792] [2019-12-27 12:55:30,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:30,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:30,329 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 6 states. [2019-12-27 12:55:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:31,013 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-27 12:55:31,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:55:31,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 12:55:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:31,142 INFO L225 Difference]: With dead ends: 48757 [2019-12-27 12:55:31,142 INFO L226 Difference]: Without dead ends: 48237 [2019-12-27 12:55:31,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 12:55:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-27 12:55:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-27 12:55:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-27 12:55:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-27 12:55:32,261 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-27 12:55:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:32,261 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-27 12:55:32,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-27 12:55:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:55:32,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:32,280 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] [2019-12-27 12:55:32,281 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-27 12:55:32,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:32,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809636450] [2019-12-27 12:55:32,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:32,403 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:55:32,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809636450] [2019-12-27 12:55:32,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:32,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:32,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082364015] [2019-12-27 12:55:32,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:32,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:32,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:32,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:32,407 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-27 12:55:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:33,534 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-27 12:55:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:33,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 12:55:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:33,645 INFO L225 Difference]: With dead ends: 53006 [2019-12-27 12:55:33,645 INFO L226 Difference]: Without dead ends: 52030 [2019-12-27 12:55:33,645 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:55:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-27 12:55:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-27 12:55:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-27 12:55:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-27 12:55:36,212 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-27 12:55:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:36,213 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-27 12:55:36,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-27 12:55:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:55:36,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:36,233 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] [2019-12-27 12:55:36,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-27 12:55:36,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:36,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368921221] [2019-12-27 12:55:36,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:36,341 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:55:36,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368921221] [2019-12-27 12:55:36,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:36,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:36,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922141386] [2019-12-27 12:55:36,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:36,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:36,344 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-27 12:55:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:37,382 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-27 12:55:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:55:37,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 12:55:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:37,530 INFO L225 Difference]: With dead ends: 70898 [2019-12-27 12:55:37,530 INFO L226 Difference]: Without dead ends: 70898 [2019-12-27 12:55:37,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:55:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-27 12:55:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-27 12:55:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-27 12:55:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-27 12:55:41,695 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-27 12:55:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:41,695 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-27 12:55:41,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-27 12:55:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 12:55:41,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:41,710 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] [2019-12-27 12:55:41,710 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-27 12:55:41,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:41,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433557246] [2019-12-27 12:55:41,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:41,779 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:55:41,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433557246] [2019-12-27 12:55:41,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:41,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:55:41,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913194773] [2019-12-27 12:55:41,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:55:41,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:41,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:55:41,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:55:41,782 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-12-27 12:55:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:42,074 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-12-27 12:55:42,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:55:42,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 12:55:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:42,200 INFO L225 Difference]: With dead ends: 43857 [2019-12-27 12:55:42,200 INFO L226 Difference]: Without dead ends: 43353 [2019-12-27 12:55:42,200 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:55:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-12-27 12:55:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-12-27 12:55:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-12-27 12:55:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-12-27 12:55:43,369 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-12-27 12:55:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:43,369 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-12-27 12:55:43,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:55:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-12-27 12:55:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 12:55:43,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:43,381 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] [2019-12-27 12:55:43,381 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1658901394, now seen corresponding path program 1 times [2019-12-27 12:55:43,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:43,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522383690] [2019-12-27 12:55:43,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:43,481 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:55:43,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522383690] [2019-12-27 12:55:43,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:43,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891166968] [2019-12-27 12:55:43,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:43,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:43,486 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-12-27 12:55:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:44,256 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-12-27 12:55:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:44,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 12:55:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:44,365 INFO L225 Difference]: With dead ends: 54550 [2019-12-27 12:55:44,365 INFO L226 Difference]: Without dead ends: 54550 [2019-12-27 12:55:44,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:55:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-12-27 12:55:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-12-27 12:55:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 12:55:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-12-27 12:55:45,695 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-12-27 12:55:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:45,695 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-12-27 12:55:45,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-12-27 12:55:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 12:55:45,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:45,706 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] [2019-12-27 12:55:45,706 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -771397713, now seen corresponding path program 1 times [2019-12-27 12:55:45,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:45,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711295726] [2019-12-27 12:55:45,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:45,771 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:55:45,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711295726] [2019-12-27 12:55:45,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:45,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:45,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172948594] [2019-12-27 12:55:45,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:45,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:45,773 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-12-27 12:55:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:45,827 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-12-27 12:55:45,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:45,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 12:55:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:45,840 INFO L225 Difference]: With dead ends: 8164 [2019-12-27 12:55:45,840 INFO L226 Difference]: Without dead ends: 6755 [2019-12-27 12:55:45,840 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:55:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-12-27 12:55:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-12-27 12:55:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-12-27 12:55:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-12-27 12:55:45,924 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-12-27 12:55:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:45,924 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-12-27 12:55:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-12-27 12:55:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 12:55:45,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:45,929 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] [2019-12-27 12:55:45,929 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-27 12:55:45,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:45,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611408465] [2019-12-27 12:55:45,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:45,979 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:55:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611408465] [2019-12-27 12:55:45,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:45,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764050283] [2019-12-27 12:55:45,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:45,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:45,982 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-12-27 12:55:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:46,107 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-12-27 12:55:46,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:46,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 12:55:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:46,118 INFO L225 Difference]: With dead ends: 7892 [2019-12-27 12:55:46,118 INFO L226 Difference]: Without dead ends: 7892 [2019-12-27 12:55:46,119 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:55:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-12-27 12:55:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-12-27 12:55:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-12-27 12:55:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-12-27 12:55:46,231 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-12-27 12:55:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:46,231 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-12-27 12:55:46,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-12-27 12:55:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 12:55:46,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:46,235 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] [2019-12-27 12:55:46,236 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-27 12:55:46,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:46,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746006895] [2019-12-27 12:55:46,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:46,318 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:55:46,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746006895] [2019-12-27 12:55:46,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:46,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:46,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300858636] [2019-12-27 12:55:46,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:46,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:46,321 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-12-27 12:55:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:46,686 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-12-27 12:55:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:55:46,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 12:55:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:46,698 INFO L225 Difference]: With dead ends: 9269 [2019-12-27 12:55:46,698 INFO L226 Difference]: Without dead ends: 9221 [2019-12-27 12:55:46,698 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:55:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-27 12:55:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-12-27 12:55:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-12-27 12:55:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-12-27 12:55:46,797 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-12-27 12:55:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:46,798 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-12-27 12:55:46,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-12-27 12:55:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:46,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:46,805 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] [2019-12-27 12:55:46,805 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:46,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2066677115, now seen corresponding path program 1 times [2019-12-27 12:55:46,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:46,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721049086] [2019-12-27 12:55:46,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:46,870 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:55:46,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721049086] [2019-12-27 12:55:46,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:46,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:46,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003260350] [2019-12-27 12:55:46,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:46,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:46,872 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-12-27 12:55:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:47,103 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-12-27 12:55:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:55:47,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 12:55:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:47,117 INFO L225 Difference]: With dead ends: 10666 [2019-12-27 12:55:47,117 INFO L226 Difference]: Without dead ends: 10666 [2019-12-27 12:55:47,118 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:55:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-27 12:55:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-12-27 12:55:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-12-27 12:55:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-12-27 12:55:47,236 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-12-27 12:55:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:47,236 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-12-27 12:55:47,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-12-27 12:55:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:47,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:47,244 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] [2019-12-27 12:55:47,244 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash -983525700, now seen corresponding path program 1 times [2019-12-27 12:55:47,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:47,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155429027] [2019-12-27 12:55:47,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:47,314 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:55:47,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155429027] [2019-12-27 12:55:47,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:47,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:47,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956621923] [2019-12-27 12:55:47,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:47,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:47,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:47,319 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-12-27 12:55:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:48,463 INFO L93 Difference]: Finished difference Result 17149 states and 50035 transitions. [2019-12-27 12:55:48,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:55:48,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-27 12:55:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:48,497 INFO L225 Difference]: With dead ends: 17149 [2019-12-27 12:55:48,497 INFO L226 Difference]: Without dead ends: 17149 [2019-12-27 12:55:48,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:55:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-27 12:55:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12308. [2019-12-27 12:55:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-27 12:55:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 35903 transitions. [2019-12-27 12:55:48,710 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 35903 transitions. Word has length 69 [2019-12-27 12:55:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:48,710 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 35903 transitions. [2019-12-27 12:55:48,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 35903 transitions. [2019-12-27 12:55:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:48,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:48,725 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] [2019-12-27 12:55:48,726 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1494059877, now seen corresponding path program 1 times [2019-12-27 12:55:48,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:48,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273649959] [2019-12-27 12:55:48,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:48,807 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:55:48,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273649959] [2019-12-27 12:55:48,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:48,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:48,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258436276] [2019-12-27 12:55:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:48,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:48,809 INFO L87 Difference]: Start difference. First operand 12308 states and 35903 transitions. Second operand 7 states. [2019-12-27 12:55:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:50,160 INFO L93 Difference]: Finished difference Result 17995 states and 52090 transitions. [2019-12-27 12:55:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 12:55:50,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-27 12:55:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:50,186 INFO L225 Difference]: With dead ends: 17995 [2019-12-27 12:55:50,186 INFO L226 Difference]: Without dead ends: 17638 [2019-12-27 12:55:50,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 12:55:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-27 12:55:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 15469. [2019-12-27 12:55:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-27 12:55:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 45203 transitions. [2019-12-27 12:55:50,386 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 45203 transitions. Word has length 69 [2019-12-27 12:55:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:50,386 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 45203 transitions. [2019-12-27 12:55:50,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 45203 transitions. [2019-12-27 12:55:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:50,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:50,398 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] [2019-12-27 12:55:50,398 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:50,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1003956060, now seen corresponding path program 1 times [2019-12-27 12:55:50,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:50,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79515997] [2019-12-27 12:55:50,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:50,494 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:55:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79515997] [2019-12-27 12:55:50,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:50,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:50,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671020925] [2019-12-27 12:55:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:50,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:50,498 INFO L87 Difference]: Start difference. First operand 15469 states and 45203 transitions. Second operand 6 states. [2019-12-27 12:55:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:50,969 INFO L93 Difference]: Finished difference Result 15470 states and 44822 transitions. [2019-12-27 12:55:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:55:50,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-27 12:55:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:50,990 INFO L225 Difference]: With dead ends: 15470 [2019-12-27 12:55:50,990 INFO L226 Difference]: Without dead ends: 15470 [2019-12-27 12:55:50,990 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:55:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-27 12:55:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 15030. [2019-12-27 12:55:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15030 states. [2019-12-27 12:55:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 43684 transitions. [2019-12-27 12:55:51,181 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 43684 transitions. Word has length 69 [2019-12-27 12:55:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:51,181 INFO L462 AbstractCegarLoop]: Abstraction has 15030 states and 43684 transitions. [2019-12-27 12:55:51,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 43684 transitions. [2019-12-27 12:55:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:51,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:51,191 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] [2019-12-27 12:55:51,192 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1234232253, now seen corresponding path program 1 times [2019-12-27 12:55:51,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:51,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796742034] [2019-12-27 12:55:51,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:51,274 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:55:51,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796742034] [2019-12-27 12:55:51,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:51,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:51,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123784161] [2019-12-27 12:55:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:51,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:51,277 INFO L87 Difference]: Start difference. First operand 15030 states and 43684 transitions. Second operand 5 states. [2019-12-27 12:55:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:51,730 INFO L93 Difference]: Finished difference Result 19011 states and 54959 transitions. [2019-12-27 12:55:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:55:51,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 12:55:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:51,764 INFO L225 Difference]: With dead ends: 19011 [2019-12-27 12:55:51,765 INFO L226 Difference]: Without dead ends: 19011 [2019-12-27 12:55:51,765 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:55:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19011 states. [2019-12-27 12:55:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19011 to 16078. [2019-12-27 12:55:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-12-27 12:55:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 46402 transitions. [2019-12-27 12:55:52,080 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 46402 transitions. Word has length 69 [2019-12-27 12:55:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:52,080 INFO L462 AbstractCegarLoop]: Abstraction has 16078 states and 46402 transitions. [2019-12-27 12:55:52,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 46402 transitions. [2019-12-27 12:55:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:52,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:52,090 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] [2019-12-27 12:55:52,090 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:52,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-27 12:55:52,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:52,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715690055] [2019-12-27 12:55:52,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:52,161 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:55:52,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715690055] [2019-12-27 12:55:52,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:52,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:55:52,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673772828] [2019-12-27 12:55:52,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:55:52,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:52,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:55:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:55:52,164 INFO L87 Difference]: Start difference. First operand 16078 states and 46402 transitions. Second operand 4 states. [2019-12-27 12:55:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:52,658 INFO L93 Difference]: Finished difference Result 19504 states and 56336 transitions. [2019-12-27 12:55:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:52,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 12:55:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:52,686 INFO L225 Difference]: With dead ends: 19504 [2019-12-27 12:55:52,686 INFO L226 Difference]: Without dead ends: 19129 [2019-12-27 12:55:52,687 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:55:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2019-12-27 12:55:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 15673. [2019-12-27 12:55:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2019-12-27 12:55:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 45021 transitions. [2019-12-27 12:55:52,915 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 45021 transitions. Word has length 69 [2019-12-27 12:55:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:52,916 INFO L462 AbstractCegarLoop]: Abstraction has 15673 states and 45021 transitions. [2019-12-27 12:55:52,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:55:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 45021 transitions. [2019-12-27 12:55:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:52,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:52,927 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] [2019-12-27 12:55:52,927 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-27 12:55:52,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:52,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014098407] [2019-12-27 12:55:52,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:53,038 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:55:53,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014098407] [2019-12-27 12:55:53,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:53,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:53,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720398193] [2019-12-27 12:55:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:53,040 INFO L87 Difference]: Start difference. First operand 15673 states and 45021 transitions. Second operand 7 states. [2019-12-27 12:55:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:53,552 INFO L93 Difference]: Finished difference Result 18442 states and 51997 transitions. [2019-12-27 12:55:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:55:53,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-27 12:55:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:53,578 INFO L225 Difference]: With dead ends: 18442 [2019-12-27 12:55:53,578 INFO L226 Difference]: Without dead ends: 18442 [2019-12-27 12:55:53,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:55:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18442 states. [2019-12-27 12:55:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18442 to 13249. [2019-12-27 12:55:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13249 states. [2019-12-27 12:55:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13249 states to 13249 states and 37337 transitions. [2019-12-27 12:55:53,774 INFO L78 Accepts]: Start accepts. Automaton has 13249 states and 37337 transitions. Word has length 69 [2019-12-27 12:55:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:53,774 INFO L462 AbstractCegarLoop]: Abstraction has 13249 states and 37337 transitions. [2019-12-27 12:55:53,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13249 states and 37337 transitions. [2019-12-27 12:55:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 12:55:53,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:53,783 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] [2019-12-27 12:55:53,784 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash -185749602, now seen corresponding path program 1 times [2019-12-27 12:55:53,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:53,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713882722] [2019-12-27 12:55:53,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:53,849 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:55:53,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713882722] [2019-12-27 12:55:53,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:53,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:53,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931259958] [2019-12-27 12:55:53,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:53,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:53,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:53,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:53,851 INFO L87 Difference]: Start difference. First operand 13249 states and 37337 transitions. Second operand 5 states. [2019-12-27 12:55:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:53,911 INFO L93 Difference]: Finished difference Result 4414 states and 10777 transitions. [2019-12-27 12:55:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:55:53,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 12:55:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:53,917 INFO L225 Difference]: With dead ends: 4414 [2019-12-27 12:55:53,918 INFO L226 Difference]: Without dead ends: 3669 [2019-12-27 12:55:53,918 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:55:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-12-27 12:55:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2984. [2019-12-27 12:55:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-12-27 12:55:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 7116 transitions. [2019-12-27 12:55:53,977 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 7116 transitions. Word has length 69 [2019-12-27 12:55:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:53,977 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 7116 transitions. [2019-12-27 12:55:53,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 7116 transitions. [2019-12-27 12:55:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:53,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:53,983 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] [2019-12-27 12:55:53,983 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -529521906, now seen corresponding path program 1 times [2019-12-27 12:55:53,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:53,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902065473] [2019-12-27 12:55:53,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:54,083 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:55:54,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902065473] [2019-12-27 12:55:54,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:54,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:54,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926358872] [2019-12-27 12:55:54,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:54,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:54,086 INFO L87 Difference]: Start difference. First operand 2984 states and 7116 transitions. Second operand 7 states. [2019-12-27 12:55:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:54,814 INFO L93 Difference]: Finished difference Result 3650 states and 8571 transitions. [2019-12-27 12:55:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 12:55:54,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-27 12:55:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:54,819 INFO L225 Difference]: With dead ends: 3650 [2019-12-27 12:55:54,820 INFO L226 Difference]: Without dead ends: 3619 [2019-12-27 12:55:54,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 12:55:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2019-12-27 12:55:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 3142. [2019-12-27 12:55:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2019-12-27 12:55:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 7455 transitions. [2019-12-27 12:55:54,853 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 7455 transitions. Word has length 86 [2019-12-27 12:55:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:54,853 INFO L462 AbstractCegarLoop]: Abstraction has 3142 states and 7455 transitions. [2019-12-27 12:55:54,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 7455 transitions. [2019-12-27 12:55:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:54,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:54,856 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] [2019-12-27 12:55:54,856 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-27 12:55:54,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:54,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205430493] [2019-12-27 12:55:54,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:54,957 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:55:54,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205430493] [2019-12-27 12:55:54,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:54,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:55:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735665851] [2019-12-27 12:55:54,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:55:54,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:55:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:55:54,960 INFO L87 Difference]: Start difference. First operand 3142 states and 7455 transitions. Second operand 7 states. [2019-12-27 12:55:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:55,041 INFO L93 Difference]: Finished difference Result 5150 states and 12338 transitions. [2019-12-27 12:55:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:55:55,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-27 12:55:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:55,045 INFO L225 Difference]: With dead ends: 5150 [2019-12-27 12:55:55,045 INFO L226 Difference]: Without dead ends: 2097 [2019-12-27 12:55:55,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 12:55:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-12-27 12:55:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2019-12-27 12:55:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-12-27 12:55:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 5031 transitions. [2019-12-27 12:55:55,073 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 5031 transitions. Word has length 86 [2019-12-27 12:55:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:55,073 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 5031 transitions. [2019-12-27 12:55:55,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:55:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 5031 transitions. [2019-12-27 12:55:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:55,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:55,077 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:55,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1306645324, now seen corresponding path program 1 times [2019-12-27 12:55:55,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:55,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906964717] [2019-12-27 12:55:55,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:55,152 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:55:55,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906964717] [2019-12-27 12:55:55,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:55,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:55:55,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486395617] [2019-12-27 12:55:55,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:55:55,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:55,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:55:55,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:55:55,155 INFO L87 Difference]: Start difference. First operand 2097 states and 5031 transitions. Second operand 5 states. [2019-12-27 12:55:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:55,338 INFO L93 Difference]: Finished difference Result 2340 states and 5547 transitions. [2019-12-27 12:55:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:55:55,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-27 12:55:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:55,342 INFO L225 Difference]: With dead ends: 2340 [2019-12-27 12:55:55,342 INFO L226 Difference]: Without dead ends: 2318 [2019-12-27 12:55:55,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-27 12:55:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2135. [2019-12-27 12:55:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-27 12:55:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 5116 transitions. [2019-12-27 12:55:55,372 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 5116 transitions. Word has length 86 [2019-12-27 12:55:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:55,372 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 5116 transitions. [2019-12-27 12:55:55,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:55:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 5116 transitions. [2019-12-27 12:55:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:55,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:55,375 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] [2019-12-27 12:55:55,376 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash -613543627, now seen corresponding path program 1 times [2019-12-27 12:55:55,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:55,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333031901] [2019-12-27 12:55:55,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:55,471 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:55:55,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333031901] [2019-12-27 12:55:55,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:55,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:55:55,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846424893] [2019-12-27 12:55:55,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:55:55,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:55,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:55:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:55,473 INFO L87 Difference]: Start difference. First operand 2135 states and 5116 transitions. Second operand 6 states. [2019-12-27 12:55:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:55,730 INFO L93 Difference]: Finished difference Result 2332 states and 5568 transitions. [2019-12-27 12:55:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:55:55,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-27 12:55:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:55,734 INFO L225 Difference]: With dead ends: 2332 [2019-12-27 12:55:55,735 INFO L226 Difference]: Without dead ends: 2332 [2019-12-27 12:55:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:55:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-12-27 12:55:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2077. [2019-12-27 12:55:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-12-27 12:55:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 4994 transitions. [2019-12-27 12:55:55,757 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 4994 transitions. Word has length 86 [2019-12-27 12:55:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:55,757 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 4994 transitions. [2019-12-27 12:55:55,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:55:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 4994 transitions. [2019-12-27 12:55:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:55,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:55,759 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] [2019-12-27 12:55:55,760 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash 644452468, now seen corresponding path program 1 times [2019-12-27 12:55:55,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:55,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601299380] [2019-12-27 12:55:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:55,909 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:55:55,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601299380] [2019-12-27 12:55:55,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:55,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:55:55,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779766574] [2019-12-27 12:55:55,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:55:55,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:55:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:55:55,911 INFO L87 Difference]: Start difference. First operand 2077 states and 4994 transitions. Second operand 8 states. [2019-12-27 12:55:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:56,269 INFO L93 Difference]: Finished difference Result 2314 states and 5516 transitions. [2019-12-27 12:55:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:55:56,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-27 12:55:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:56,275 INFO L225 Difference]: With dead ends: 2314 [2019-12-27 12:55:56,275 INFO L226 Difference]: Without dead ends: 2314 [2019-12-27 12:55:56,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-27 12:55:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-12-27 12:55:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2074. [2019-12-27 12:55:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-27 12:55:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4979 transitions. [2019-12-27 12:55:56,324 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4979 transitions. Word has length 86 [2019-12-27 12:55:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:56,324 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4979 transitions. [2019-12-27 12:55:56,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:55:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4979 transitions. [2019-12-27 12:55:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:56,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:56,329 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] [2019-12-27 12:55:56,329 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 2 times [2019-12-27 12:55:56,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:56,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925124301] [2019-12-27 12:55:56,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:55:56,581 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:55:56,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925124301] [2019-12-27 12:55:56,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:55:56,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 12:55:56,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016844331] [2019-12-27 12:55:56,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 12:55:56,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:55:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 12:55:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-27 12:55:56,584 INFO L87 Difference]: Start difference. First operand 2074 states and 4979 transitions. Second operand 10 states. [2019-12-27 12:55:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:55:56,893 INFO L93 Difference]: Finished difference Result 3624 states and 8593 transitions. [2019-12-27 12:55:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 12:55:56,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-27 12:55:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:55:56,898 INFO L225 Difference]: With dead ends: 3624 [2019-12-27 12:55:56,898 INFO L226 Difference]: Without dead ends: 2384 [2019-12-27 12:55:56,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 12:55:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2019-12-27 12:55:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2141. [2019-12-27 12:55:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-12-27 12:55:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 5073 transitions. [2019-12-27 12:55:56,930 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 5073 transitions. Word has length 86 [2019-12-27 12:55:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:55:56,931 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 5073 transitions. [2019-12-27 12:55:56,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 12:55:56,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 5073 transitions. [2019-12-27 12:55:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 12:55:56,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:55:56,934 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] [2019-12-27 12:55:56,934 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:55:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:55:56,934 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 3 times [2019-12-27 12:55:56,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:55:56,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836075026] [2019-12-27 12:55:56,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:55:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:55:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:55:57,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:55:57,053 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:55:57,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:55:57 BasicIcfg [2019-12-27 12:55:57,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:55:57,252 INFO L168 Benchmark]: Toolchain (without parser) took 43310.54 ms. Allocated memory was 145.2 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 101.6 MB in the beginning and 962.4 MB in the end (delta: -860.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,252 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 12:55:57,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.47 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 159.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.88 ms. Allocated memory is still 202.9 MB. Free memory was 159.0 MB in the beginning and 156.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,254 INFO L168 Benchmark]: Boogie Preprocessor took 38.41 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,254 INFO L168 Benchmark]: RCFGBuilder took 760.23 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 112.6 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,255 INFO L168 Benchmark]: TraceAbstraction took 41694.32 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 112.6 MB in the beginning and 962.4 MB in the end (delta: -849.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 12:55:57,258 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.47 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 159.0 MB in the end (delta: -57.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.88 ms. Allocated memory is still 202.9 MB. Free memory was 159.0 MB in the beginning and 156.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.41 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.23 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 112.6 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41694.32 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 112.6 MB in the beginning and 962.4 MB in the end (delta: -849.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L801] 0 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L803] 0 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$r_buff0_thd2=1, 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, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L812] 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 [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.3s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7060 SDtfs, 8641 SDslu, 16499 SDs, 0 SdLazy, 6593 SolverSat, 393 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 72639 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 300688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...