/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/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 11:40:36,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 11:40:36,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 11:40:36,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 11:40:36,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 11:40:36,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 11:40:36,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 11:40:36,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 11:40:36,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 11:40:36,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 11:40:36,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 11:40:36,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 11:40:36,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 11:40:36,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 11:40:36,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 11:40:36,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 11:40:36,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 11:40:36,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 11:40:36,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 11:40:36,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 11:40:36,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 11:40:36,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 11:40:36,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 11:40:36,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 11:40:36,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 11:40:36,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 11:40:36,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 11:40:36,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 11:40:36,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 11:40:36,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 11:40:36,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 11:40:36,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 11:40:36,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 11:40:36,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 11:40:36,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 11:40:36,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 11:40:36,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 11:40:36,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 11:40:36,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 11:40:36,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 11:40:36,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 11:40:36,600 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 11:40:36,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 11:40:36,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 11:40:36,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 11:40:36,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 11:40:36,616 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 11:40:36,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 11:40:36,617 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 11:40:36,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 11:40:36,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 11:40:36,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 11:40:36,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 11:40:36,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 11:40:36,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 11:40:36,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 11:40:36,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 11:40:36,619 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 11:40:36,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 11:40:36,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 11:40:36,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 11:40:36,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 11:40:36,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 11:40:36,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 11:40:36,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 11:40:36,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 11:40:36,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 11:40:36,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 11:40:36,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 11:40:36,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 11:40:36,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 11:40:36,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 11:40:36,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 11:40:36,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 11:40:36,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 11:40:36,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 11:40:36,973 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 11:40:36,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-27 11:40:37,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa8106cb/89874dd6c4ac405ebff3b8f54998063a/FLAGe777c5dfe [2019-12-27 11:40:37,581 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 11:40:37,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2019-12-27 11:40:37,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa8106cb/89874dd6c4ac405ebff3b8f54998063a/FLAGe777c5dfe [2019-12-27 11:40:37,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa8106cb/89874dd6c4ac405ebff3b8f54998063a [2019-12-27 11:40:37,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 11:40:37,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 11:40:37,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 11:40:37,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 11:40:37,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 11:40:37,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:40:37" (1/1) ... [2019-12-27 11:40:37,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:37, skipping insertion in model container [2019-12-27 11:40:37,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:40:37" (1/1) ... [2019-12-27 11:40:37,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 11:40:37,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 11:40:38,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:40:38,517 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 11:40:38,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 11:40:38,667 INFO L208 MainTranslator]: Completed translation [2019-12-27 11:40:38,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38 WrapperNode [2019-12-27 11:40:38,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 11:40:38,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 11:40:38,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 11:40:38,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 11:40:38,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 11:40:38,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 11:40:38,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 11:40:38,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 11:40:38,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (1/1) ... [2019-12-27 11:40:38,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 11:40:38,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 11:40:38,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 11:40:38,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 11:40:38,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (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 11:40:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 11:40:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 11:40:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 11:40:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 11:40:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 11:40:38,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 11:40:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 11:40:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 11:40:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 11:40:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 11:40:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 11:40:38,869 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 11:40:39,652 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 11:40:39,653 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 11:40:39,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:40:39 BoogieIcfgContainer [2019-12-27 11:40:39,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 11:40:39,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 11:40:39,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 11:40:39,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 11:40:39,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:40:37" (1/3) ... [2019-12-27 11:40:39,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f104bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:40:39, skipping insertion in model container [2019-12-27 11:40:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:40:38" (2/3) ... [2019-12-27 11:40:39,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f104bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:40:39, skipping insertion in model container [2019-12-27 11:40:39,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:40:39" (3/3) ... [2019-12-27 11:40:39,663 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2019-12-27 11:40:39,674 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 11:40:39,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 11:40:39,683 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 11:40:39,684 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 11:40:39,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,751 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 11:40:39,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 11:40:39,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 11:40:39,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 11:40:39,792 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 11:40:39,792 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 11:40:39,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 11:40:39,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 11:40:39,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 11:40:39,793 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 11:40:39,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-27 11:40:41,344 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-27 11:40:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-27 11:40:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 11:40:41,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:41,356 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] [2019-12-27 11:40:41,357 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 697146637, now seen corresponding path program 1 times [2019-12-27 11:40:41,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189521919] [2019-12-27 11:40:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:41,756 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 11:40:41,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189521919] [2019-12-27 11:40:41,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:41,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:40:41,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79581513] [2019-12-27 11:40:41,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:40:41,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:40:41,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:40:41,781 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-27 11:40:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:43,072 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-27 11:40:43,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:40:43,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 11:40:43,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:43,334 INFO L225 Difference]: With dead ends: 23448 [2019-12-27 11:40:43,334 INFO L226 Difference]: Without dead ends: 21272 [2019-12-27 11:40:43,338 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 11:40:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-27 11:40:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-27 11:40:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-27 11:40:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-27 11:40:44,472 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-27 11:40:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:44,473 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-27 11:40:44,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:40:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-27 11:40:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 11:40:44,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:44,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:40:44,480 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1403469956, now seen corresponding path program 1 times [2019-12-27 11:40:44,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:44,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512453718] [2019-12-27 11:40:44,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:44,587 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 11:40:44,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512453718] [2019-12-27 11:40:44,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:44,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:40:44,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43128674] [2019-12-27 11:40:44,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:40:44,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:40:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:40:44,591 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-27 11:40:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:45,556 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-27 11:40:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:40:45,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 11:40:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:45,720 INFO L225 Difference]: With dead ends: 34706 [2019-12-27 11:40:45,721 INFO L226 Difference]: Without dead ends: 34562 [2019-12-27 11:40:45,722 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 11:40:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-27 11:40:48,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-27 11:40:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-27 11:40:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-27 11:40:48,180 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-27 11:40:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:48,183 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-27 11:40:48,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:40:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-27 11:40:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 11:40:48,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:48,190 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] [2019-12-27 11:40:48,190 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 227456424, now seen corresponding path program 1 times [2019-12-27 11:40:48,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:48,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177336796] [2019-12-27 11:40:48,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:48,352 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 11:40:48,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177336796] [2019-12-27 11:40:48,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:48,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:40:48,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763604425] [2019-12-27 11:40:48,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:40:48,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:40:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:40:48,357 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-27 11:40:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:48,918 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-27 11:40:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:40:48,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 11:40:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:50,515 INFO L225 Difference]: With dead ends: 40214 [2019-12-27 11:40:50,515 INFO L226 Difference]: Without dead ends: 40054 [2019-12-27 11:40:50,515 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 11:40:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-27 11:40:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-27 11:40:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-27 11:40:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-27 11:40:51,626 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-27 11:40:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:51,626 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-27 11:40:51,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:40:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-27 11:40:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 11:40:51,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:51,641 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] [2019-12-27 11:40:51,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash -171706089, now seen corresponding path program 1 times [2019-12-27 11:40:51,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:51,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489366326] [2019-12-27 11:40:51,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:51,767 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 11:40:51,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489366326] [2019-12-27 11:40:51,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:51,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:40:51,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003228298] [2019-12-27 11:40:51,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:40:51,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:51,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:40:51,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:40:51,770 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-27 11:40:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:52,758 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-27 11:40:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 11:40:52,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 11:40:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:53,269 INFO L225 Difference]: With dead ends: 45663 [2019-12-27 11:40:53,271 INFO L226 Difference]: Without dead ends: 45519 [2019-12-27 11:40:53,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 11:40:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-27 11:40:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-27 11:40:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-27 11:40:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-27 11:40:56,173 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-27 11:40:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:56,173 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-27 11:40:56,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:40:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-27 11:40:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 11:40:56,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:56,209 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] [2019-12-27 11:40:56,209 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1292892266, now seen corresponding path program 1 times [2019-12-27 11:40:56,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:56,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134302227] [2019-12-27 11:40:56,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:56,349 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 11:40:56,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134302227] [2019-12-27 11:40:56,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:56,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:40:56,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595813634] [2019-12-27 11:40:56,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:40:56,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:40:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:40:56,352 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-27 11:40:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:57,039 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-27 11:40:57,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 11:40:57,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 11:40:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:57,138 INFO L225 Difference]: With dead ends: 46070 [2019-12-27 11:40:57,138 INFO L226 Difference]: Without dead ends: 45830 [2019-12-27 11:40:57,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:40:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-27 11:40:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-27 11:40:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-27 11:40:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-27 11:40:58,158 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-27 11:40:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:58,159 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-27 11:40:58,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:40:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-27 11:40:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 11:40:58,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:58,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] [2019-12-27 11:40:58,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash 43524005, now seen corresponding path program 1 times [2019-12-27 11:40:58,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:58,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869553140] [2019-12-27 11:40:58,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:58,241 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 11:40:58,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869553140] [2019-12-27 11:40:58,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:58,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:40:58,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370232794] [2019-12-27 11:40:58,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:40:58,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:40:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:40:58,244 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-27 11:40:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:40:58,484 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-27 11:40:58,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:40:58,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 11:40:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:40:58,593 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 11:40:58,593 INFO L226 Difference]: Without dead ends: 50257 [2019-12-27 11:40:58,593 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 11:40:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-27 11:40:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-27 11:40:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-27 11:40:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-27 11:40:59,838 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-27 11:40:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:40:59,838 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-27 11:40:59,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:40:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-27 11:40:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 11:40:59,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:40:59,873 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] [2019-12-27 11:40:59,873 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:40:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:40:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash -41034466, now seen corresponding path program 1 times [2019-12-27 11:40:59,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:40:59,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113261168] [2019-12-27 11:40:59,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:40:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:40:59,971 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 11:40:59,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113261168] [2019-12-27 11:40:59,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:40:59,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:40:59,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014380976] [2019-12-27 11:40:59,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:40:59,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:40:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:40:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:40:59,974 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-27 11:41:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:02,250 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-27 11:41:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 11:41:02,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 11:41:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:02,368 INFO L225 Difference]: With dead ends: 55885 [2019-12-27 11:41:02,368 INFO L226 Difference]: Without dead ends: 55645 [2019-12-27 11:41:02,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 11:41:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-27 11:41:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-27 11:41:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-27 11:41:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-27 11:41:03,409 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-27 11:41:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:03,409 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-27 11:41:03,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:41:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-27 11:41:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 11:41:03,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:03,442 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] [2019-12-27 11:41:03,442 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -44622651, now seen corresponding path program 1 times [2019-12-27 11:41:03,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:03,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418244563] [2019-12-27 11:41:03,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:03,533 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 11:41:03,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418244563] [2019-12-27 11:41:03,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:03,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:41:03,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141570601] [2019-12-27 11:41:03,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:41:03,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:03,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:41:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:03,535 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-27 11:41:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:04,730 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-27 11:41:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 11:41:04,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 11:41:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:04,874 INFO L225 Difference]: With dead ends: 55099 [2019-12-27 11:41:04,874 INFO L226 Difference]: Without dead ends: 54899 [2019-12-27 11:41:04,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 11:41:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-27 11:41:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-27 11:41:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-27 11:41:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-27 11:41:06,260 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-27 11:41:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:06,260 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-27 11:41:06,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:41:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-27 11:41:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 11:41:06,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:06,294 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] [2019-12-27 11:41:06,294 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash 500322373, now seen corresponding path program 1 times [2019-12-27 11:41:06,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:06,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814741999] [2019-12-27 11:41:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:06,413 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 11:41:06,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814741999] [2019-12-27 11:41:06,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:06,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:06,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804708030] [2019-12-27 11:41:06,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:06,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:06,416 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-27 11:41:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:07,518 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-27 11:41:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 11:41:07,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 11:41:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:07,659 INFO L225 Difference]: With dead ends: 65553 [2019-12-27 11:41:07,659 INFO L226 Difference]: Without dead ends: 64909 [2019-12-27 11:41:07,659 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 11:41:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-27 11:41:08,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-27 11:41:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-27 11:41:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-27 11:41:11,676 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-27 11:41:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:11,676 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-27 11:41:11,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-27 11:41:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 11:41:11,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:11,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, 1] [2019-12-27 11:41:11,725 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1461936390, now seen corresponding path program 1 times [2019-12-27 11:41:11,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:11,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460239435] [2019-12-27 11:41:11,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:11,843 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 11:41:11,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460239435] [2019-12-27 11:41:11,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:11,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:41:11,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548857542] [2019-12-27 11:41:11,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:41:11,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:41:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:11,845 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-27 11:41:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:12,982 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-27 11:41:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 11:41:12,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 11:41:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:13,157 INFO L225 Difference]: With dead ends: 83031 [2019-12-27 11:41:13,157 INFO L226 Difference]: Without dead ends: 83031 [2019-12-27 11:41:13,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 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 11:41:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-27 11:41:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-27 11:41:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-27 11:41:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-27 11:41:14,869 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-27 11:41:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:14,869 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-27 11:41:14,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:41:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-27 11:41:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 11:41:14,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:14,946 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] [2019-12-27 11:41:14,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1588266425, now seen corresponding path program 1 times [2019-12-27 11:41:14,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:14,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297213246] [2019-12-27 11:41:14,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:15,039 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 11:41:15,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297213246] [2019-12-27 11:41:15,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:15,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:41:15,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944829536] [2019-12-27 11:41:15,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:41:15,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:15,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:41:15,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:41:15,041 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 4 states. [2019-12-27 11:41:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:15,146 INFO L93 Difference]: Finished difference Result 17225 states and 54507 transitions. [2019-12-27 11:41:15,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:41:15,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-27 11:41:15,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:15,180 INFO L225 Difference]: With dead ends: 17225 [2019-12-27 11:41:15,181 INFO L226 Difference]: Without dead ends: 16747 [2019-12-27 11:41:15,182 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 11:41:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16747 states. [2019-12-27 11:41:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16747 to 16735. [2019-12-27 11:41:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16735 states. [2019-12-27 11:41:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 53002 transitions. [2019-12-27 11:41:15,409 INFO L78 Accepts]: Start accepts. Automaton has 16735 states and 53002 transitions. Word has length 70 [2019-12-27 11:41:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:15,409 INFO L462 AbstractCegarLoop]: Abstraction has 16735 states and 53002 transitions. [2019-12-27 11:41:15,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:41:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 16735 states and 53002 transitions. [2019-12-27 11:41:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 11:41:15,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:15,421 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] [2019-12-27 11:41:15,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:15,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:15,421 INFO L82 PathProgramCache]: Analyzing trace with hash -977177849, now seen corresponding path program 1 times [2019-12-27 11:41:15,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:15,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37721478] [2019-12-27 11:41:15,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:15,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 11:41:15,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37721478] [2019-12-27 11:41:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:15,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:41:15,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236662126] [2019-12-27 11:41:15,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:41:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:41:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:41:15,483 INFO L87 Difference]: Start difference. First operand 16735 states and 53002 transitions. Second operand 4 states. [2019-12-27 11:41:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:15,738 INFO L93 Difference]: Finished difference Result 22099 states and 69083 transitions. [2019-12-27 11:41:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:41:15,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 11:41:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:15,771 INFO L225 Difference]: With dead ends: 22099 [2019-12-27 11:41:15,771 INFO L226 Difference]: Without dead ends: 22099 [2019-12-27 11:41:15,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 11:41:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22099 states. [2019-12-27 11:41:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22099 to 17611. [2019-12-27 11:41:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17611 states. [2019-12-27 11:41:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17611 states to 17611 states and 55561 transitions. [2019-12-27 11:41:16,188 INFO L78 Accepts]: Start accepts. Automaton has 17611 states and 55561 transitions. Word has length 80 [2019-12-27 11:41:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:16,188 INFO L462 AbstractCegarLoop]: Abstraction has 17611 states and 55561 transitions. [2019-12-27 11:41:16,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:41:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 17611 states and 55561 transitions. [2019-12-27 11:41:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 11:41:16,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:16,201 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] [2019-12-27 11:41:16,201 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:16,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1231914394, now seen corresponding path program 1 times [2019-12-27 11:41:16,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:16,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507063977] [2019-12-27 11:41:16,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:16,286 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 11:41:16,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507063977] [2019-12-27 11:41:16,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:16,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 11:41:16,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126057200] [2019-12-27 11:41:16,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 11:41:16,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:16,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 11:41:16,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:41:16,288 INFO L87 Difference]: Start difference. First operand 17611 states and 55561 transitions. Second operand 8 states. [2019-12-27 11:41:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:17,389 INFO L93 Difference]: Finished difference Result 19705 states and 61637 transitions. [2019-12-27 11:41:17,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 11:41:17,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-27 11:41:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:17,420 INFO L225 Difference]: With dead ends: 19705 [2019-12-27 11:41:17,420 INFO L226 Difference]: Without dead ends: 19657 [2019-12-27 11:41:17,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 11:41:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19657 states. [2019-12-27 11:41:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19657 to 15529. [2019-12-27 11:41:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-12-27 11:41:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 49295 transitions. [2019-12-27 11:41:17,655 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 49295 transitions. Word has length 80 [2019-12-27 11:41:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:17,655 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 49295 transitions. [2019-12-27 11:41:17,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 11:41:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 49295 transitions. [2019-12-27 11:41:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 11:41:17,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:17,673 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] [2019-12-27 11:41:17,674 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:17,674 INFO L82 PathProgramCache]: Analyzing trace with hash 480666418, now seen corresponding path program 1 times [2019-12-27 11:41:17,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:17,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549079803] [2019-12-27 11:41:17,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:17,721 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 11:41:17,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549079803] [2019-12-27 11:41:17,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:17,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:41:17,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593056924] [2019-12-27 11:41:17,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:41:17,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:41:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:41:17,724 INFO L87 Difference]: Start difference. First operand 15529 states and 49295 transitions. Second operand 3 states. [2019-12-27 11:41:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:17,962 INFO L93 Difference]: Finished difference Result 16793 states and 53008 transitions. [2019-12-27 11:41:17,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:41:17,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-27 11:41:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:17,988 INFO L225 Difference]: With dead ends: 16793 [2019-12-27 11:41:17,988 INFO L226 Difference]: Without dead ends: 16793 [2019-12-27 11:41:17,989 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 11:41:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-12-27 11:41:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 16145. [2019-12-27 11:41:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16145 states. [2019-12-27 11:41:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 51109 transitions. [2019-12-27 11:41:18,210 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 51109 transitions. Word has length 81 [2019-12-27 11:41:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:18,211 INFO L462 AbstractCegarLoop]: Abstraction has 16145 states and 51109 transitions. [2019-12-27 11:41:18,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:41:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 51109 transitions. [2019-12-27 11:41:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 11:41:18,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:18,224 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] [2019-12-27 11:41:18,225 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 678513047, now seen corresponding path program 1 times [2019-12-27 11:41:18,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:18,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756740896] [2019-12-27 11:41:18,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:18,285 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 11:41:18,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756740896] [2019-12-27 11:41:18,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:18,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:41:18,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611029620] [2019-12-27 11:41:18,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:41:18,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:18,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:41:18,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:41:18,287 INFO L87 Difference]: Start difference. First operand 16145 states and 51109 transitions. Second operand 4 states. [2019-12-27 11:41:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:18,599 INFO L93 Difference]: Finished difference Result 19273 states and 60155 transitions. [2019-12-27 11:41:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 11:41:18,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-27 11:41:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:18,631 INFO L225 Difference]: With dead ends: 19273 [2019-12-27 11:41:18,631 INFO L226 Difference]: Without dead ends: 19273 [2019-12-27 11:41:18,631 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 11:41:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2019-12-27 11:41:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 18250. [2019-12-27 11:41:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18250 states. [2019-12-27 11:41:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18250 states to 18250 states and 57271 transitions. [2019-12-27 11:41:19,081 INFO L78 Accepts]: Start accepts. Automaton has 18250 states and 57271 transitions. Word has length 82 [2019-12-27 11:41:19,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:19,081 INFO L462 AbstractCegarLoop]: Abstraction has 18250 states and 57271 transitions. [2019-12-27 11:41:19,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:41:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 18250 states and 57271 transitions. [2019-12-27 11:41:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 11:41:19,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:19,097 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] [2019-12-27 11:41:19,097 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1257147240, now seen corresponding path program 1 times [2019-12-27 11:41:19,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:19,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129696421] [2019-12-27 11:41:19,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:19,139 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 11:41:19,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129696421] [2019-12-27 11:41:19,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:19,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:41:19,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215644442] [2019-12-27 11:41:19,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:41:19,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:41:19,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:41:19,143 INFO L87 Difference]: Start difference. First operand 18250 states and 57271 transitions. Second operand 3 states. [2019-12-27 11:41:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:19,392 INFO L93 Difference]: Finished difference Result 19581 states and 61170 transitions. [2019-12-27 11:41:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:41:19,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-27 11:41:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:19,421 INFO L225 Difference]: With dead ends: 19581 [2019-12-27 11:41:19,421 INFO L226 Difference]: Without dead ends: 19581 [2019-12-27 11:41:19,422 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 11:41:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19581 states. [2019-12-27 11:41:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19581 to 18922. [2019-12-27 11:41:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-27 11:41:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 59235 transitions. [2019-12-27 11:41:19,676 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 59235 transitions. Word has length 82 [2019-12-27 11:41:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:19,676 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 59235 transitions. [2019-12-27 11:41:19,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:41:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 59235 transitions. [2019-12-27 11:41:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 11:41:19,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:19,692 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] [2019-12-27 11:41:19,692 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash 966454904, now seen corresponding path program 1 times [2019-12-27 11:41:19,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:19,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351958873] [2019-12-27 11:41:19,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:19,800 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 11:41:19,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351958873] [2019-12-27 11:41:19,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:19,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:19,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022090309] [2019-12-27 11:41:19,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:19,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:19,803 INFO L87 Difference]: Start difference. First operand 18922 states and 59235 transitions. Second operand 6 states. [2019-12-27 11:41:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:20,654 INFO L93 Difference]: Finished difference Result 27781 states and 85391 transitions. [2019-12-27 11:41:20,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:41:20,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 11:41:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:20,695 INFO L225 Difference]: With dead ends: 27781 [2019-12-27 11:41:20,695 INFO L226 Difference]: Without dead ends: 27475 [2019-12-27 11:41:20,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:41:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27475 states. [2019-12-27 11:41:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27475 to 21952. [2019-12-27 11:41:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21952 states. [2019-12-27 11:41:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21952 states to 21952 states and 68575 transitions. [2019-12-27 11:41:21,033 INFO L78 Accepts]: Start accepts. Automaton has 21952 states and 68575 transitions. Word has length 83 [2019-12-27 11:41:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:21,033 INFO L462 AbstractCegarLoop]: Abstraction has 21952 states and 68575 transitions. [2019-12-27 11:41:21,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21952 states and 68575 transitions. [2019-12-27 11:41:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 11:41:21,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:21,051 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] [2019-12-27 11:41:21,051 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1928068921, now seen corresponding path program 1 times [2019-12-27 11:41:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:21,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511765922] [2019-12-27 11:41:21,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:21,153 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 11:41:21,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511765922] [2019-12-27 11:41:21,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:21,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:41:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22071595] [2019-12-27 11:41:21,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:41:21,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:41:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:21,155 INFO L87 Difference]: Start difference. First operand 21952 states and 68575 transitions. Second operand 7 states. [2019-12-27 11:41:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:22,387 INFO L93 Difference]: Finished difference Result 39375 states and 118842 transitions. [2019-12-27 11:41:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 11:41:22,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 11:41:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:22,444 INFO L225 Difference]: With dead ends: 39375 [2019-12-27 11:41:22,444 INFO L226 Difference]: Without dead ends: 39303 [2019-12-27 11:41:22,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 11:41:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39303 states. [2019-12-27 11:41:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39303 to 23773. [2019-12-27 11:41:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23773 states. [2019-12-27 11:41:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23773 states to 23773 states and 73009 transitions. [2019-12-27 11:41:23,050 INFO L78 Accepts]: Start accepts. Automaton has 23773 states and 73009 transitions. Word has length 83 [2019-12-27 11:41:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:23,050 INFO L462 AbstractCegarLoop]: Abstraction has 23773 states and 73009 transitions. [2019-12-27 11:41:23,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:41:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23773 states and 73009 transitions. [2019-12-27 11:41:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 11:41:23,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:23,073 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] [2019-12-27 11:41:23,073 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1122133894, now seen corresponding path program 1 times [2019-12-27 11:41:23,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:23,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408270112] [2019-12-27 11:41:23,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:23,191 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 11:41:23,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408270112] [2019-12-27 11:41:23,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:23,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215509739] [2019-12-27 11:41:23,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:23,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:23,194 INFO L87 Difference]: Start difference. First operand 23773 states and 73009 transitions. Second operand 6 states. [2019-12-27 11:41:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:23,432 INFO L93 Difference]: Finished difference Result 24821 states and 75816 transitions. [2019-12-27 11:41:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:41:23,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 11:41:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:23,467 INFO L225 Difference]: With dead ends: 24821 [2019-12-27 11:41:23,468 INFO L226 Difference]: Without dead ends: 24821 [2019-12-27 11:41:23,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 11:41:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2019-12-27 11:41:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 24471. [2019-12-27 11:41:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24471 states. [2019-12-27 11:41:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24471 states to 24471 states and 74914 transitions. [2019-12-27 11:41:23,790 INFO L78 Accepts]: Start accepts. Automaton has 24471 states and 74914 transitions. Word has length 83 [2019-12-27 11:41:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:23,791 INFO L462 AbstractCegarLoop]: Abstraction has 24471 states and 74914 transitions. [2019-12-27 11:41:23,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24471 states and 74914 transitions. [2019-12-27 11:41:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 11:41:23,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:23,814 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] [2019-12-27 11:41:23,814 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 43771321, now seen corresponding path program 1 times [2019-12-27 11:41:23,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:23,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385531101] [2019-12-27 11:41:23,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:23,912 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 11:41:23,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385531101] [2019-12-27 11:41:23,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:23,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:23,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385373374] [2019-12-27 11:41:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:23,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:23,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:23,914 INFO L87 Difference]: Start difference. First operand 24471 states and 74914 transitions. Second operand 6 states. [2019-12-27 11:41:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:24,613 INFO L93 Difference]: Finished difference Result 36681 states and 111434 transitions. [2019-12-27 11:41:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:41:24,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 11:41:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:24,667 INFO L225 Difference]: With dead ends: 36681 [2019-12-27 11:41:24,667 INFO L226 Difference]: Without dead ends: 36681 [2019-12-27 11:41:24,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:41:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36681 states. [2019-12-27 11:41:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36681 to 27102. [2019-12-27 11:41:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27102 states. [2019-12-27 11:41:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27102 states to 27102 states and 82608 transitions. [2019-12-27 11:41:25,090 INFO L78 Accepts]: Start accepts. Automaton has 27102 states and 82608 transitions. Word has length 83 [2019-12-27 11:41:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:25,090 INFO L462 AbstractCegarLoop]: Abstraction has 27102 states and 82608 transitions. [2019-12-27 11:41:25,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27102 states and 82608 transitions. [2019-12-27 11:41:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 11:41:25,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:25,114 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] [2019-12-27 11:41:25,114 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1288535802, now seen corresponding path program 1 times [2019-12-27 11:41:25,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:25,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636112570] [2019-12-27 11:41:25,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:25,163 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 11:41:25,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636112570] [2019-12-27 11:41:25,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:25,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 11:41:25,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256154497] [2019-12-27 11:41:25,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 11:41:25,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 11:41:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 11:41:25,165 INFO L87 Difference]: Start difference. First operand 27102 states and 82608 transitions. Second operand 3 states. [2019-12-27 11:41:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:25,297 INFO L93 Difference]: Finished difference Result 21606 states and 65510 transitions. [2019-12-27 11:41:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 11:41:25,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-27 11:41:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:25,326 INFO L225 Difference]: With dead ends: 21606 [2019-12-27 11:41:25,326 INFO L226 Difference]: Without dead ends: 21528 [2019-12-27 11:41:25,327 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 11:41:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21528 states. [2019-12-27 11:41:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21528 to 18848. [2019-12-27 11:41:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18848 states. [2019-12-27 11:41:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18848 states to 18848 states and 57623 transitions. [2019-12-27 11:41:25,749 INFO L78 Accepts]: Start accepts. Automaton has 18848 states and 57623 transitions. Word has length 83 [2019-12-27 11:41:25,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:25,749 INFO L462 AbstractCegarLoop]: Abstraction has 18848 states and 57623 transitions. [2019-12-27 11:41:25,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 11:41:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18848 states and 57623 transitions. [2019-12-27 11:41:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 11:41:25,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:25,764 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] [2019-12-27 11:41:25,764 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash -686793271, now seen corresponding path program 1 times [2019-12-27 11:41:25,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:25,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315202982] [2019-12-27 11:41:25,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:25,860 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 11:41:25,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315202982] [2019-12-27 11:41:25,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:25,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:25,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897844061] [2019-12-27 11:41:25,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:25,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:25,863 INFO L87 Difference]: Start difference. First operand 18848 states and 57623 transitions. Second operand 6 states. [2019-12-27 11:41:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:26,518 INFO L93 Difference]: Finished difference Result 31403 states and 94952 transitions. [2019-12-27 11:41:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 11:41:26,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-27 11:41:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:26,565 INFO L225 Difference]: With dead ends: 31403 [2019-12-27 11:41:26,565 INFO L226 Difference]: Without dead ends: 31283 [2019-12-27 11:41:26,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 11:41:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-12-27 11:41:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 24905. [2019-12-27 11:41:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24905 states. [2019-12-27 11:41:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24905 states to 24905 states and 76412 transitions. [2019-12-27 11:41:26,936 INFO L78 Accepts]: Start accepts. Automaton has 24905 states and 76412 transitions. Word has length 84 [2019-12-27 11:41:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:26,936 INFO L462 AbstractCegarLoop]: Abstraction has 24905 states and 76412 transitions. [2019-12-27 11:41:26,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24905 states and 76412 transitions. [2019-12-27 11:41:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 11:41:26,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:26,956 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] [2019-12-27 11:41:26,956 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash 557971210, now seen corresponding path program 1 times [2019-12-27 11:41:26,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:26,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935369009] [2019-12-27 11:41:26,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:27,036 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 11:41:27,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935369009] [2019-12-27 11:41:27,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:27,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:41:27,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976671347] [2019-12-27 11:41:27,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:41:27,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:41:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:41:27,040 INFO L87 Difference]: Start difference. First operand 24905 states and 76412 transitions. Second operand 5 states. [2019-12-27 11:41:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:27,083 INFO L93 Difference]: Finished difference Result 3242 states and 8015 transitions. [2019-12-27 11:41:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 11:41:27,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 11:41:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:27,087 INFO L225 Difference]: With dead ends: 3242 [2019-12-27 11:41:27,087 INFO L226 Difference]: Without dead ends: 2861 [2019-12-27 11:41:27,088 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 11:41:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-12-27 11:41:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2635. [2019-12-27 11:41:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2019-12-27 11:41:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 6485 transitions. [2019-12-27 11:41:27,126 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 6485 transitions. Word has length 84 [2019-12-27 11:41:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:27,126 INFO L462 AbstractCegarLoop]: Abstraction has 2635 states and 6485 transitions. [2019-12-27 11:41:27,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:41:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 6485 transitions. [2019-12-27 11:41:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:27,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:27,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:27,130 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1708084537, now seen corresponding path program 1 times [2019-12-27 11:41:27,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:27,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868165995] [2019-12-27 11:41:27,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:27,247 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 11:41:27,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868165995] [2019-12-27 11:41:27,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:27,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:27,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866485884] [2019-12-27 11:41:27,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:27,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:27,249 INFO L87 Difference]: Start difference. First operand 2635 states and 6485 transitions. Second operand 6 states. [2019-12-27 11:41:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:27,330 INFO L93 Difference]: Finished difference Result 2560 states and 6303 transitions. [2019-12-27 11:41:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:41:27,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 11:41:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:27,334 INFO L225 Difference]: With dead ends: 2560 [2019-12-27 11:41:27,334 INFO L226 Difference]: Without dead ends: 2560 [2019-12-27 11:41:27,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-12-27 11:41:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2436. [2019-12-27 11:41:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2436 states. [2019-12-27 11:41:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 5998 transitions. [2019-12-27 11:41:27,359 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 5998 transitions. Word has length 97 [2019-12-27 11:41:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:27,359 INFO L462 AbstractCegarLoop]: Abstraction has 2436 states and 5998 transitions. [2019-12-27 11:41:27,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 5998 transitions. [2019-12-27 11:41:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:27,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:27,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:27,362 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash -948837094, now seen corresponding path program 1 times [2019-12-27 11:41:27,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:27,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189113302] [2019-12-27 11:41:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:27,476 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 11:41:27,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189113302] [2019-12-27 11:41:27,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:27,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:27,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835029139] [2019-12-27 11:41:27,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:27,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:27,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:27,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:27,479 INFO L87 Difference]: Start difference. First operand 2436 states and 5998 transitions. Second operand 6 states. [2019-12-27 11:41:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:27,561 INFO L93 Difference]: Finished difference Result 2626 states and 6327 transitions. [2019-12-27 11:41:27,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:41:27,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 11:41:27,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:27,565 INFO L225 Difference]: With dead ends: 2626 [2019-12-27 11:41:27,565 INFO L226 Difference]: Without dead ends: 2581 [2019-12-27 11:41:27,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2019-12-27 11:41:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2459. [2019-12-27 11:41:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-12-27 11:41:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 5991 transitions. [2019-12-27 11:41:27,591 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 5991 transitions. Word has length 97 [2019-12-27 11:41:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:27,591 INFO L462 AbstractCegarLoop]: Abstraction has 2459 states and 5991 transitions. [2019-12-27 11:41:27,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 5991 transitions. [2019-12-27 11:41:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:27,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:27,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:27,594 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1410469915, now seen corresponding path program 1 times [2019-12-27 11:41:27,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:27,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206572934] [2019-12-27 11:41:27,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:27,684 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 11:41:27,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206572934] [2019-12-27 11:41:27,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:27,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 11:41:27,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168928] [2019-12-27 11:41:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 11:41:27,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 11:41:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:27,687 INFO L87 Difference]: Start difference. First operand 2459 states and 5991 transitions. Second operand 7 states. [2019-12-27 11:41:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:28,076 INFO L93 Difference]: Finished difference Result 4518 states and 11136 transitions. [2019-12-27 11:41:28,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:41:28,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-27 11:41:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:28,082 INFO L225 Difference]: With dead ends: 4518 [2019-12-27 11:41:28,082 INFO L226 Difference]: Without dead ends: 4518 [2019-12-27 11:41:28,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 11:41:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2019-12-27 11:41:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 2591. [2019-12-27 11:41:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2019-12-27 11:41:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 6264 transitions. [2019-12-27 11:41:28,113 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 6264 transitions. Word has length 97 [2019-12-27 11:41:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:28,113 INFO L462 AbstractCegarLoop]: Abstraction has 2591 states and 6264 transitions. [2019-12-27 11:41:28,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 11:41:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 6264 transitions. [2019-12-27 11:41:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:28,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:28,118 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:28,118 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1740235676, now seen corresponding path program 1 times [2019-12-27 11:41:28,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:28,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925856803] [2019-12-27 11:41:28,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:28,177 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 11:41:28,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925856803] [2019-12-27 11:41:28,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:28,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 11:41:28,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212912863] [2019-12-27 11:41:28,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 11:41:28,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 11:41:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 11:41:28,180 INFO L87 Difference]: Start difference. First operand 2591 states and 6264 transitions. Second operand 4 states. [2019-12-27 11:41:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:28,274 INFO L93 Difference]: Finished difference Result 2555 states and 6144 transitions. [2019-12-27 11:41:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:41:28,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 11:41:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:28,280 INFO L225 Difference]: With dead ends: 2555 [2019-12-27 11:41:28,280 INFO L226 Difference]: Without dead ends: 2555 [2019-12-27 11:41:28,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:41:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-12-27 11:41:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-12-27 11:41:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-12-27 11:41:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 6144 transitions. [2019-12-27 11:41:28,325 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 6144 transitions. Word has length 97 [2019-12-27 11:41:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:28,325 INFO L462 AbstractCegarLoop]: Abstraction has 2555 states and 6144 transitions. [2019-12-27 11:41:28,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 11:41:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 6144 transitions. [2019-12-27 11:41:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:28,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:28,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:28,331 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -553018629, now seen corresponding path program 1 times [2019-12-27 11:41:28,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:28,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352492530] [2019-12-27 11:41:28,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:28,453 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 11:41:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352492530] [2019-12-27 11:41:28,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:41:28,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638884738] [2019-12-27 11:41:28,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:41:28,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:41:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:41:28,456 INFO L87 Difference]: Start difference. First operand 2555 states and 6144 transitions. Second operand 5 states. [2019-12-27 11:41:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:28,711 INFO L93 Difference]: Finished difference Result 2861 states and 6849 transitions. [2019-12-27 11:41:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 11:41:28,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 11:41:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:28,717 INFO L225 Difference]: With dead ends: 2861 [2019-12-27 11:41:28,717 INFO L226 Difference]: Without dead ends: 2843 [2019-12-27 11:41:28,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 11:41:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-27 11:41:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2582. [2019-12-27 11:41:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-12-27 11:41:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 6198 transitions. [2019-12-27 11:41:28,771 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 6198 transitions. Word has length 97 [2019-12-27 11:41:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:28,772 INFO L462 AbstractCegarLoop]: Abstraction has 2582 states and 6198 transitions. [2019-12-27 11:41:28,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:41:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 6198 transitions. [2019-12-27 11:41:28,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:28,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:28,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:28,777 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:28,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:28,778 INFO L82 PathProgramCache]: Analyzing trace with hash 691745852, now seen corresponding path program 1 times [2019-12-27 11:41:28,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:28,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13825674] [2019-12-27 11:41:28,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:28,896 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 11:41:28,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13825674] [2019-12-27 11:41:28,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 11:41:28,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427402272] [2019-12-27 11:41:28,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 11:41:28,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 11:41:28,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 11:41:28,899 INFO L87 Difference]: Start difference. First operand 2582 states and 6198 transitions. Second operand 5 states. [2019-12-27 11:41:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:28,958 INFO L93 Difference]: Finished difference Result 3439 states and 8363 transitions. [2019-12-27 11:41:28,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 11:41:28,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 11:41:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:28,965 INFO L225 Difference]: With dead ends: 3439 [2019-12-27 11:41:28,966 INFO L226 Difference]: Without dead ends: 3439 [2019-12-27 11:41:28,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2019-12-27 11:41:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2450. [2019-12-27 11:41:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2019-12-27 11:41:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5870 transitions. [2019-12-27 11:41:29,024 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5870 transitions. Word has length 97 [2019-12-27 11:41:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:29,024 INFO L462 AbstractCegarLoop]: Abstraction has 2450 states and 5870 transitions. [2019-12-27 11:41:29,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 11:41:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5870 transitions. [2019-12-27 11:41:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:29,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:29,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:29,029 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash -821367206, now seen corresponding path program 1 times [2019-12-27 11:41:29,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:29,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60066171] [2019-12-27 11:41:29,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:29,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 11:41:29,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60066171] [2019-12-27 11:41:29,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:29,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 11:41:29,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006764948] [2019-12-27 11:41:29,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 11:41:29,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 11:41:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 11:41:29,163 INFO L87 Difference]: Start difference. First operand 2450 states and 5870 transitions. Second operand 6 states. [2019-12-27 11:41:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:29,345 INFO L93 Difference]: Finished difference Result 2703 states and 6326 transitions. [2019-12-27 11:41:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:41:29,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-27 11:41:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:29,349 INFO L225 Difference]: With dead ends: 2703 [2019-12-27 11:41:29,349 INFO L226 Difference]: Without dead ends: 2703 [2019-12-27 11:41:29,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 11:41:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-27 11:41:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2493. [2019-12-27 11:41:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-12-27 11:41:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 5926 transitions. [2019-12-27 11:41:29,379 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 5926 transitions. Word has length 97 [2019-12-27 11:41:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:29,380 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 5926 transitions. [2019-12-27 11:41:29,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 11:41:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 5926 transitions. [2019-12-27 11:41:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:29,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:29,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:29,382 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:29,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:29,382 INFO L82 PathProgramCache]: Analyzing trace with hash -491601445, now seen corresponding path program 1 times [2019-12-27 11:41:29,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:29,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896200891] [2019-12-27 11:41:29,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 11:41:29,550 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 11:41:29,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896200891] [2019-12-27 11:41:29,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 11:41:29,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 11:41:29,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992640458] [2019-12-27 11:41:29,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 11:41:29,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 11:41:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 11:41:29,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 11:41:29,553 INFO L87 Difference]: Start difference. First operand 2493 states and 5926 transitions. Second operand 8 states. [2019-12-27 11:41:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 11:41:29,741 INFO L93 Difference]: Finished difference Result 3839 states and 9160 transitions. [2019-12-27 11:41:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 11:41:29,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 11:41:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 11:41:29,745 INFO L225 Difference]: With dead ends: 3839 [2019-12-27 11:41:29,745 INFO L226 Difference]: Without dead ends: 1428 [2019-12-27 11:41:29,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 11:41:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-27 11:41:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-27 11:41:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-27 11:41:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-27 11:41:29,775 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-27 11:41:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 11:41:29,776 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-27 11:41:29,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 11:41:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-27 11:41:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 11:41:29,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 11:41:29,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 11:41:29,827 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 11:41:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 11:41:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash 530847507, now seen corresponding path program 2 times [2019-12-27 11:41:29,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 11:41:29,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042945202] [2019-12-27 11:41:29,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 11:41:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:41:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 11:41:29,938 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 11:41:29,939 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 11:41:30,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:41:30 BasicIcfg [2019-12-27 11:41:30,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 11:41:30,137 INFO L168 Benchmark]: Toolchain (without parser) took 52248.80 ms. Allocated memory was 140.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 96.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 575.7 MB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,142 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 116.9 MB in the beginning and 116.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.13 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 96.2 MB in the beginning and 152.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 198.2 MB. Free memory was 152.0 MB in the beginning and 149.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 11:41:30,149 INFO L168 Benchmark]: Boogie Preprocessor took 37.25 ms. Allocated memory is still 198.2 MB. Free memory was 149.1 MB in the beginning and 146.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,149 INFO L168 Benchmark]: RCFGBuilder took 874.50 ms. Allocated memory is still 198.2 MB. Free memory was 146.9 MB in the beginning and 102.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,149 INFO L168 Benchmark]: TraceAbstraction took 50478.84 ms. Allocated memory was 198.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 523.3 MB. Max. memory is 7.1 GB. [2019-12-27 11:41:30,151 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.22 ms. Allocated memory is still 140.5 MB. Free memory was 116.9 MB in the beginning and 116.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.13 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 96.2 MB in the beginning and 152.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 198.2 MB. Free memory was 152.0 MB in the beginning and 149.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 37.25 ms. Allocated memory is still 198.2 MB. Free memory was 149.1 MB in the beginning and 146.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 874.50 ms. Allocated memory is still 198.2 MB. Free memory was 146.9 MB in the beginning and 102.4 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50478.84 ms. Allocated memory was 198.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 523.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 0 pthread_t t1103; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 0 pthread_t t1104; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8470 SDtfs, 9200 SDslu, 18178 SDs, 0 SdLazy, 8251 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 85 SyntacticMatches, 18 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76080occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 121269 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 462178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...