/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/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:19:49,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:19:49,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:19:49,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:19:49,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:19:49,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:19:49,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:19:49,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:19:49,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:19:49,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:19:49,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:19:49,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:19:49,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:19:49,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:19:49,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:19:49,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:19:49,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:19:49,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:19:49,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:19:49,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:19:49,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:19:49,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:19:49,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:19:49,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:19:49,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:19:49,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:19:49,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:19:49,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:19:49,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:19:49,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:19:49,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:19:49,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:19:49,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:19:49,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:19:49,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:19:49,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:19:49,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:19:49,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:19:49,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:19:49,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:19:49,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:19:49,682 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-19 05:19:49,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:19:49,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:19:49,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:19:49,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:19:49,706 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:19:49,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:19:49,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:19:49,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:19:49,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:19:49,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:19:49,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:19:49,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:19:49,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:19:49,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:19:49,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:19:49,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:19:49,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:19:49,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:19:49,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:19:49,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:19:49,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:19:49,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:19:49,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:19:49,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:19:49,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:19:49,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:19:49,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:19:49,712 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:19:49,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:19:49,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:19:50,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:19:50,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:19:50,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:19:50,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:19:50,020 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:19:50,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-19 05:19:50,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84df4a54/cfa5b75db0cc457b9b51e6224ac349fc/FLAG084fca18f [2019-12-19 05:19:50,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:19:50,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2019-12-19 05:19:50,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84df4a54/cfa5b75db0cc457b9b51e6224ac349fc/FLAG084fca18f [2019-12-19 05:19:50,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84df4a54/cfa5b75db0cc457b9b51e6224ac349fc [2019-12-19 05:19:50,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:19:51,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:19:51,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:19:51,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:19:51,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:19:51,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:19:50" (1/1) ... [2019-12-19 05:19:51,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a0d51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51, skipping insertion in model container [2019-12-19 05:19:51,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:19:50" (1/1) ... [2019-12-19 05:19:51,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:19:51,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:19:51,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:19:51,639 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:19:51,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:19:51,801 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:19:51,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51 WrapperNode [2019-12-19 05:19:51,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:19:51,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:19:51,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:19:51,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:19:51,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:19:51,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:19:51,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:19:51,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:19:51,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (1/1) ... [2019-12-19 05:19:51,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:19:51,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:19:51,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:19:51,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:19:51,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (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-19 05:19:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:19:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:19:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:19:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:19:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:19:51,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:19:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:19:51,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:19:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:19:51,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:19:51,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:19:51,982 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:19:52,733 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:19:52,734 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:19:52,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:19:52 BoogieIcfgContainer [2019-12-19 05:19:52,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:19:52,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:19:52,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:19:52,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:19:52,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:19:50" (1/3) ... [2019-12-19 05:19:52,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7f262a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:19:52, skipping insertion in model container [2019-12-19 05:19:52,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:51" (2/3) ... [2019-12-19 05:19:52,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d7f262a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:19:52, skipping insertion in model container [2019-12-19 05:19:52,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:19:52" (3/3) ... [2019-12-19 05:19:52,753 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-12-19 05:19:52,764 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:19:52,765 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:19:52,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:19:52,787 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:19:52,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:52,874 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:19:52,896 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:19:52,896 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:19:52,896 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:19:52,896 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:19:52,897 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:19:52,897 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:19:52,897 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:19:52,897 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:19:52,912 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:19:54,381 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-12-19 05:19:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-12-19 05:19:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 05:19:54,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:54,395 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] [2019-12-19 05:19:54,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2054349026, now seen corresponding path program 1 times [2019-12-19 05:19:54,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:54,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247902883] [2019-12-19 05:19:54,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:54,730 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-19 05:19:54,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247902883] [2019-12-19 05:19:54,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:54,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:54,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615554415] [2019-12-19 05:19:54,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:54,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:54,756 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-12-19 05:19:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:55,384 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-12-19 05:19:55,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:19:55,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 05:19:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:55,613 INFO L225 Difference]: With dead ends: 23445 [2019-12-19 05:19:55,613 INFO L226 Difference]: Without dead ends: 21269 [2019-12-19 05:19:55,615 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-19 05:19:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-12-19 05:19:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-12-19 05:19:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-19 05:19:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-12-19 05:19:57,706 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-12-19 05:19:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:57,707 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-12-19 05:19:57,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-12-19 05:19:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:19:57,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:57,713 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] [2019-12-19 05:19:57,714 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash 99870175, now seen corresponding path program 1 times [2019-12-19 05:19:57,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:57,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136835962] [2019-12-19 05:19:57,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:57,855 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-19 05:19:57,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136835962] [2019-12-19 05:19:57,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:57,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:57,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393140353] [2019-12-19 05:19:57,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:57,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:57,859 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-12-19 05:19:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:58,974 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-12-19 05:19:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:58,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:19:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:59,140 INFO L225 Difference]: With dead ends: 34703 [2019-12-19 05:19:59,141 INFO L226 Difference]: Without dead ends: 34559 [2019-12-19 05:19:59,142 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-19 05:19:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-12-19 05:20:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-12-19 05:20:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-12-19 05:20:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-12-19 05:20:01,366 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-12-19 05:20:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:01,368 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-12-19 05:20:01,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-12-19 05:20:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:20:01,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:01,379 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] [2019-12-19 05:20:01,380 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 268512672, now seen corresponding path program 1 times [2019-12-19 05:20:01,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:01,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564113039] [2019-12-19 05:20:01,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:01,556 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-19 05:20:01,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564113039] [2019-12-19 05:20:01,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:01,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:01,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989576734] [2019-12-19 05:20:01,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:01,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:01,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:01,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:01,559 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-12-19 05:20:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:02,397 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-12-19 05:20:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:02,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:20:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:02,531 INFO L225 Difference]: With dead ends: 40211 [2019-12-19 05:20:02,531 INFO L226 Difference]: Without dead ends: 40051 [2019-12-19 05:20:02,531 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-19 05:20:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-12-19 05:20:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-12-19 05:20:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-12-19 05:20:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-12-19 05:20:05,060 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-12-19 05:20:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:05,061 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-12-19 05:20:05,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-12-19 05:20:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:20:05,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:05,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:05,081 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2144969569, now seen corresponding path program 1 times [2019-12-19 05:20:05,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:05,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153772065] [2019-12-19 05:20:05,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:05,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-19 05:20:05,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153772065] [2019-12-19 05:20:05,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:05,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:05,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260307516] [2019-12-19 05:20:05,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:05,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:05,249 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-12-19 05:20:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:06,478 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-12-19 05:20:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:20:06,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:20:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:06,621 INFO L225 Difference]: With dead ends: 45660 [2019-12-19 05:20:06,621 INFO L226 Difference]: Without dead ends: 45516 [2019-12-19 05:20:06,622 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-19 05:20:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-12-19 05:20:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-12-19 05:20:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-12-19 05:20:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-12-19 05:20:09,002 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-12-19 05:20:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:09,003 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-12-19 05:20:09,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-12-19 05:20:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:20:09,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:09,037 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] [2019-12-19 05:20:09,037 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1490455740, now seen corresponding path program 1 times [2019-12-19 05:20:09,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:09,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592839887] [2019-12-19 05:20:09,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:09,176 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-19 05:20:09,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592839887] [2019-12-19 05:20:09,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:09,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:09,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958800064] [2019-12-19 05:20:09,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:09,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:09,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:09,179 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-12-19 05:20:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:09,894 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-12-19 05:20:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:20:09,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:20:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:09,991 INFO L225 Difference]: With dead ends: 46067 [2019-12-19 05:20:09,992 INFO L226 Difference]: Without dead ends: 45827 [2019-12-19 05:20:09,992 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-19 05:20:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-12-19 05:20:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-12-19 05:20:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-12-19 05:20:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-12-19 05:20:11,084 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-12-19 05:20:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:11,085 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-12-19 05:20:11,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-12-19 05:20:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:20:11,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:11,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:11,115 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1015725706, now seen corresponding path program 1 times [2019-12-19 05:20:11,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:11,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920701882] [2019-12-19 05:20:11,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:11,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-19 05:20:11,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920701882] [2019-12-19 05:20:11,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:11,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:11,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196004814] [2019-12-19 05:20:11,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:11,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:11,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:11,163 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-12-19 05:20:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:11,772 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-12-19 05:20:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:11,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:20:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:11,877 INFO L225 Difference]: With dead ends: 50254 [2019-12-19 05:20:11,878 INFO L226 Difference]: Without dead ends: 50254 [2019-12-19 05:20:11,878 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-19 05:20:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-12-19 05:20:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-12-19 05:20:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-12-19 05:20:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-12-19 05:20:14,752 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-12-19 05:20:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:14,752 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-12-19 05:20:14,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-12-19 05:20:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:20:14,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:14,788 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] [2019-12-19 05:20:14,788 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1067966230, now seen corresponding path program 1 times [2019-12-19 05:20:14,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:14,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254977530] [2019-12-19 05:20:14,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:14,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-19 05:20:14,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254977530] [2019-12-19 05:20:14,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:14,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:14,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014802110] [2019-12-19 05:20:14,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:14,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:14,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:14,915 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-12-19 05:20:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:15,949 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-12-19 05:20:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:20:15,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:20:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:16,068 INFO L225 Difference]: With dead ends: 55882 [2019-12-19 05:20:16,068 INFO L226 Difference]: Without dead ends: 55642 [2019-12-19 05:20:16,069 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-19 05:20:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-12-19 05:20:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-12-19 05:20:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-12-19 05:20:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-12-19 05:20:17,311 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-12-19 05:20:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:17,311 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-12-19 05:20:17,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-12-19 05:20:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:20:17,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:17,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:17,348 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2097396923, now seen corresponding path program 1 times [2019-12-19 05:20:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:17,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575943572] [2019-12-19 05:20:17,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:17,426 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-19 05:20:17,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575943572] [2019-12-19 05:20:17,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:17,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:17,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017500204] [2019-12-19 05:20:17,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:17,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:17,428 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 7 states. [2019-12-19 05:20:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:19,031 INFO L93 Difference]: Finished difference Result 55096 states and 197674 transitions. [2019-12-19 05:20:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:20:19,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:20:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:19,199 INFO L225 Difference]: With dead ends: 55096 [2019-12-19 05:20:19,199 INFO L226 Difference]: Without dead ends: 54896 [2019-12-19 05:20:19,199 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-19 05:20:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54896 states. [2019-12-19 05:20:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54896 to 45990. [2019-12-19 05:20:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-19 05:20:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 167801 transitions. [2019-12-19 05:20:20,113 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 167801 transitions. Word has length 65 [2019-12-19 05:20:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:20,114 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 167801 transitions. [2019-12-19 05:20:20,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 167801 transitions. [2019-12-19 05:20:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:20,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:20,149 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-19 05:20:20,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:20,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash 823868575, now seen corresponding path program 1 times [2019-12-19 05:20:20,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:20,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085236822] [2019-12-19 05:20:20,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:20,262 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-19 05:20:20,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085236822] [2019-12-19 05:20:20,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:20,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:20,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068814995] [2019-12-19 05:20:20,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:20,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:20,265 INFO L87 Difference]: Start difference. First operand 45990 states and 167801 transitions. Second operand 6 states. [2019-12-19 05:20:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:21,363 INFO L93 Difference]: Finished difference Result 65550 states and 237328 transitions. [2019-12-19 05:20:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:21,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:20:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:21,506 INFO L225 Difference]: With dead ends: 65550 [2019-12-19 05:20:21,506 INFO L226 Difference]: Without dead ends: 64906 [2019-12-19 05:20:21,506 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-19 05:20:21,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64906 states. [2019-12-19 05:20:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64906 to 56040. [2019-12-19 05:20:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56040 states. [2019-12-19 05:20:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56040 states to 56040 states and 204331 transitions. [2019-12-19 05:20:25,044 INFO L78 Accepts]: Start accepts. Automaton has 56040 states and 204331 transitions. Word has length 67 [2019-12-19 05:20:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:25,044 INFO L462 AbstractCegarLoop]: Abstraction has 56040 states and 204331 transitions. [2019-12-19 05:20:25,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 56040 states and 204331 transitions. [2019-12-19 05:20:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:25,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:25,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:25,095 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1785482592, now seen corresponding path program 1 times [2019-12-19 05:20:25,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:25,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510016624] [2019-12-19 05:20:25,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:25,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-19 05:20:25,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510016624] [2019-12-19 05:20:25,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:25,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:25,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233534543] [2019-12-19 05:20:25,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:25,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:25,194 INFO L87 Difference]: Start difference. First operand 56040 states and 204331 transitions. Second operand 7 states. [2019-12-19 05:20:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:26,368 INFO L93 Difference]: Finished difference Result 83028 states and 292759 transitions. [2019-12-19 05:20:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:20:26,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:20:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:26,551 INFO L225 Difference]: With dead ends: 83028 [2019-12-19 05:20:26,552 INFO L226 Difference]: Without dead ends: 83028 [2019-12-19 05:20:26,552 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-19 05:20:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states. [2019-12-19 05:20:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83028 to 76077. [2019-12-19 05:20:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76077 states. [2019-12-19 05:20:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76077 states to 76077 states and 270626 transitions. [2019-12-19 05:20:28,398 INFO L78 Accepts]: Start accepts. Automaton has 76077 states and 270626 transitions. Word has length 67 [2019-12-19 05:20:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:28,398 INFO L462 AbstractCegarLoop]: Abstraction has 76077 states and 270626 transitions. [2019-12-19 05:20:28,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 76077 states and 270626 transitions. [2019-12-19 05:20:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:28,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:28,478 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-19 05:20:28,478 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:28,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1264720223, now seen corresponding path program 1 times [2019-12-19 05:20:28,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:28,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413700228] [2019-12-19 05:20:28,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:28,554 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-19 05:20:28,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413700228] [2019-12-19 05:20:28,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:28,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:28,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676813069] [2019-12-19 05:20:28,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:28,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:28,557 INFO L87 Difference]: Start difference. First operand 76077 states and 270626 transitions. Second operand 4 states. [2019-12-19 05:20:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:28,659 INFO L93 Difference]: Finished difference Result 17222 states and 54504 transitions. [2019-12-19 05:20:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:28,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 05:20:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:28,703 INFO L225 Difference]: With dead ends: 17222 [2019-12-19 05:20:28,703 INFO L226 Difference]: Without dead ends: 16744 [2019-12-19 05:20:28,704 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-19 05:20:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-19 05:20:28,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16732. [2019-12-19 05:20:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16732 states. [2019-12-19 05:20:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 52999 transitions. [2019-12-19 05:20:28,981 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 52999 transitions. Word has length 67 [2019-12-19 05:20:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:28,981 INFO L462 AbstractCegarLoop]: Abstraction has 16732 states and 52999 transitions. [2019-12-19 05:20:28,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 52999 transitions. [2019-12-19 05:20:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:20:28,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:28,994 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] [2019-12-19 05:20:28,994 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:28,994 INFO L82 PathProgramCache]: Analyzing trace with hash -357405743, now seen corresponding path program 1 times [2019-12-19 05:20:28,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:28,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243825977] [2019-12-19 05:20:28,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:29,057 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-19 05:20:29,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243825977] [2019-12-19 05:20:29,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:29,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:29,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877616623] [2019-12-19 05:20:29,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:29,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:29,059 INFO L87 Difference]: Start difference. First operand 16732 states and 52999 transitions. Second operand 4 states. [2019-12-19 05:20:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:29,590 INFO L93 Difference]: Finished difference Result 22096 states and 69080 transitions. [2019-12-19 05:20:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:29,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:20:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:29,622 INFO L225 Difference]: With dead ends: 22096 [2019-12-19 05:20:29,622 INFO L226 Difference]: Without dead ends: 22096 [2019-12-19 05:20:29,623 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-19 05:20:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22096 states. [2019-12-19 05:20:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22096 to 17608. [2019-12-19 05:20:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17608 states. [2019-12-19 05:20:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 55558 transitions. [2019-12-19 05:20:29,893 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 55558 transitions. Word has length 77 [2019-12-19 05:20:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:29,893 INFO L462 AbstractCegarLoop]: Abstraction has 17608 states and 55558 transitions. [2019-12-19 05:20:29,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 55558 transitions. [2019-12-19 05:20:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:20:29,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:29,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:29,908 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:29,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash -612142288, now seen corresponding path program 1 times [2019-12-19 05:20:29,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:29,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83450939] [2019-12-19 05:20:29,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:30,006 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-19 05:20:30,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83450939] [2019-12-19 05:20:30,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:30,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:20:30,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151519179] [2019-12-19 05:20:30,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:20:30,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:20:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:30,011 INFO L87 Difference]: Start difference. First operand 17608 states and 55558 transitions. Second operand 8 states. [2019-12-19 05:20:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:31,133 INFO L93 Difference]: Finished difference Result 19702 states and 61634 transitions. [2019-12-19 05:20:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:20:31,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:20:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:31,165 INFO L225 Difference]: With dead ends: 19702 [2019-12-19 05:20:31,165 INFO L226 Difference]: Without dead ends: 19654 [2019-12-19 05:20:31,165 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-19 05:20:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-19 05:20:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 15526. [2019-12-19 05:20:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15526 states. [2019-12-19 05:20:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 49292 transitions. [2019-12-19 05:20:31,391 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 49292 transitions. Word has length 77 [2019-12-19 05:20:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:31,391 INFO L462 AbstractCegarLoop]: Abstraction has 15526 states and 49292 transitions. [2019-12-19 05:20:31,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:20:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 49292 transitions. [2019-12-19 05:20:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:20:31,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:31,409 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] [2019-12-19 05:20:31,409 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:31,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2124522827, now seen corresponding path program 1 times [2019-12-19 05:20:31,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:31,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106715861] [2019-12-19 05:20:31,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:31,463 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-19 05:20:31,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106715861] [2019-12-19 05:20:31,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:31,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:31,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789162908] [2019-12-19 05:20:31,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:31,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:31,465 INFO L87 Difference]: Start difference. First operand 15526 states and 49292 transitions. Second operand 3 states. [2019-12-19 05:20:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:31,703 INFO L93 Difference]: Finished difference Result 16790 states and 53005 transitions. [2019-12-19 05:20:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:31,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:20:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:31,728 INFO L225 Difference]: With dead ends: 16790 [2019-12-19 05:20:31,728 INFO L226 Difference]: Without dead ends: 16790 [2019-12-19 05:20:31,729 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-19 05:20:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16790 states. [2019-12-19 05:20:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16790 to 16142. [2019-12-19 05:20:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16142 states. [2019-12-19 05:20:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16142 states to 16142 states and 51106 transitions. [2019-12-19 05:20:31,948 INFO L78 Accepts]: Start accepts. Automaton has 16142 states and 51106 transitions. Word has length 78 [2019-12-19 05:20:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:31,948 INFO L462 AbstractCegarLoop]: Abstraction has 16142 states and 51106 transitions. [2019-12-19 05:20:31,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16142 states and 51106 transitions. [2019-12-19 05:20:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:20:31,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:31,962 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] [2019-12-19 05:20:31,962 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:31,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2047654897, now seen corresponding path program 1 times [2019-12-19 05:20:31,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:31,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008623395] [2019-12-19 05:20:31,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:32,021 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-19 05:20:32,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008623395] [2019-12-19 05:20:32,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:32,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:32,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428557964] [2019-12-19 05:20:32,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:32,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:32,023 INFO L87 Difference]: Start difference. First operand 16142 states and 51106 transitions. Second operand 4 states. [2019-12-19 05:20:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:32,381 INFO L93 Difference]: Finished difference Result 19270 states and 60152 transitions. [2019-12-19 05:20:32,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:32,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:20:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:32,420 INFO L225 Difference]: With dead ends: 19270 [2019-12-19 05:20:32,420 INFO L226 Difference]: Without dead ends: 19270 [2019-12-19 05:20:32,421 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-19 05:20:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19270 states. [2019-12-19 05:20:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19270 to 18247. [2019-12-19 05:20:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-19 05:20:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57268 transitions. [2019-12-19 05:20:32,902 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57268 transitions. Word has length 79 [2019-12-19 05:20:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:32,903 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57268 transitions. [2019-12-19 05:20:32,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57268 transitions. [2019-12-19 05:20:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:20:32,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:32,918 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] [2019-12-19 05:20:32,918 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash 111994610, now seen corresponding path program 1 times [2019-12-19 05:20:32,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:32,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410033182] [2019-12-19 05:20:32,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:32,955 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-19 05:20:32,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410033182] [2019-12-19 05:20:32,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:32,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:32,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829380470] [2019-12-19 05:20:32,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:32,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:32,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:32,958 INFO L87 Difference]: Start difference. First operand 18247 states and 57268 transitions. Second operand 3 states. [2019-12-19 05:20:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:33,187 INFO L93 Difference]: Finished difference Result 19578 states and 61167 transitions. [2019-12-19 05:20:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:33,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:20:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:33,216 INFO L225 Difference]: With dead ends: 19578 [2019-12-19 05:20:33,216 INFO L226 Difference]: Without dead ends: 19578 [2019-12-19 05:20:33,217 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-19 05:20:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-19 05:20:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 18919. [2019-12-19 05:20:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18919 states. [2019-12-19 05:20:33,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18919 states to 18919 states and 59232 transitions. [2019-12-19 05:20:33,460 INFO L78 Accepts]: Start accepts. Automaton has 18919 states and 59232 transitions. Word has length 79 [2019-12-19 05:20:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:33,460 INFO L462 AbstractCegarLoop]: Abstraction has 18919 states and 59232 transitions. [2019-12-19 05:20:33,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18919 states and 59232 transitions. [2019-12-19 05:20:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:33,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:33,476 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-19 05:20:33,476 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1909076484, now seen corresponding path program 1 times [2019-12-19 05:20:33,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:33,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441165100] [2019-12-19 05:20:33,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:33,603 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-19 05:20:33,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441165100] [2019-12-19 05:20:33,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:33,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:33,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024541720] [2019-12-19 05:20:33,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:33,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:33,605 INFO L87 Difference]: Start difference. First operand 18919 states and 59232 transitions. Second operand 6 states. [2019-12-19 05:20:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:34,396 INFO L93 Difference]: Finished difference Result 30232 states and 93411 transitions. [2019-12-19 05:20:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:20:34,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:20:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:34,442 INFO L225 Difference]: With dead ends: 30232 [2019-12-19 05:20:34,442 INFO L226 Difference]: Without dead ends: 30232 [2019-12-19 05:20:34,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:20:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2019-12-19 05:20:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 21553. [2019-12-19 05:20:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21553 states. [2019-12-19 05:20:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21553 states to 21553 states and 66907 transitions. [2019-12-19 05:20:34,791 INFO L78 Accepts]: Start accepts. Automaton has 21553 states and 66907 transitions. Word has length 80 [2019-12-19 05:20:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:34,791 INFO L462 AbstractCegarLoop]: Abstraction has 21553 states and 66907 transitions. [2019-12-19 05:20:34,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21553 states and 66907 transitions. [2019-12-19 05:20:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:34,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:34,809 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-19 05:20:34,810 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1141126331, now seen corresponding path program 1 times [2019-12-19 05:20:34,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:34,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502704261] [2019-12-19 05:20:34,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:34,873 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-19 05:20:34,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502704261] [2019-12-19 05:20:34,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:34,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824161200] [2019-12-19 05:20:34,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:34,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:34,875 INFO L87 Difference]: Start difference. First operand 21553 states and 66907 transitions. Second operand 4 states. [2019-12-19 05:20:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:35,546 INFO L93 Difference]: Finished difference Result 28569 states and 87453 transitions. [2019-12-19 05:20:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:35,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 05:20:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:35,594 INFO L225 Difference]: With dead ends: 28569 [2019-12-19 05:20:35,594 INFO L226 Difference]: Without dead ends: 28569 [2019-12-19 05:20:35,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-19 05:20:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 25906. [2019-12-19 05:20:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25906 states. [2019-12-19 05:20:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25906 states to 25906 states and 79893 transitions. [2019-12-19 05:20:36,239 INFO L78 Accepts]: Start accepts. Automaton has 25906 states and 79893 transitions. Word has length 80 [2019-12-19 05:20:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:36,239 INFO L462 AbstractCegarLoop]: Abstraction has 25906 states and 79893 transitions. [2019-12-19 05:20:36,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25906 states and 79893 transitions. [2019-12-19 05:20:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:36,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:36,262 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-19 05:20:36,262 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -502495842, now seen corresponding path program 1 times [2019-12-19 05:20:36,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:36,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315373179] [2019-12-19 05:20:36,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:36,361 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-19 05:20:36,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315373179] [2019-12-19 05:20:36,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:36,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:36,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122584244] [2019-12-19 05:20:36,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:36,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:36,364 INFO L87 Difference]: Start difference. First operand 25906 states and 79893 transitions. Second operand 5 states. [2019-12-19 05:20:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:36,501 INFO L93 Difference]: Finished difference Result 26880 states and 82704 transitions. [2019-12-19 05:20:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:20:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:36,541 INFO L225 Difference]: With dead ends: 26880 [2019-12-19 05:20:36,541 INFO L226 Difference]: Without dead ends: 26880 [2019-12-19 05:20:36,542 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-19 05:20:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26880 states. [2019-12-19 05:20:36,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26880 to 26365. [2019-12-19 05:20:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26365 states. [2019-12-19 05:20:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26365 states to 26365 states and 81218 transitions. [2019-12-19 05:20:36,912 INFO L78 Accepts]: Start accepts. Automaton has 26365 states and 81218 transitions. Word has length 80 [2019-12-19 05:20:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:36,912 INFO L462 AbstractCegarLoop]: Abstraction has 26365 states and 81218 transitions. [2019-12-19 05:20:36,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26365 states and 81218 transitions. [2019-12-19 05:20:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:36,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:36,937 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-19 05:20:36,937 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1222985055, now seen corresponding path program 1 times [2019-12-19 05:20:36,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:36,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742128595] [2019-12-19 05:20:36,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:37,070 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-19 05:20:37,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742128595] [2019-12-19 05:20:37,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:37,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 05:20:37,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677212379] [2019-12-19 05:20:37,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 05:20:37,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 05:20:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:20:37,071 INFO L87 Difference]: Start difference. First operand 26365 states and 81218 transitions. Second operand 9 states. [2019-12-19 05:20:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:39,914 INFO L93 Difference]: Finished difference Result 47314 states and 142923 transitions. [2019-12-19 05:20:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 05:20:39,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-12-19 05:20:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:39,987 INFO L225 Difference]: With dead ends: 47314 [2019-12-19 05:20:39,987 INFO L226 Difference]: Without dead ends: 46786 [2019-12-19 05:20:39,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-19 05:20:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46786 states. [2019-12-19 05:20:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46786 to 32360. [2019-12-19 05:20:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32360 states. [2019-12-19 05:20:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32360 states to 32360 states and 100100 transitions. [2019-12-19 05:20:40,884 INFO L78 Accepts]: Start accepts. Automaton has 32360 states and 100100 transitions. Word has length 80 [2019-12-19 05:20:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:40,884 INFO L462 AbstractCegarLoop]: Abstraction has 32360 states and 100100 transitions. [2019-12-19 05:20:40,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 05:20:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32360 states and 100100 transitions. [2019-12-19 05:20:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:40,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:40,913 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-19 05:20:40,913 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1300203548, now seen corresponding path program 1 times [2019-12-19 05:20:40,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:40,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274635964] [2019-12-19 05:20:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:41,006 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-19 05:20:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274635964] [2019-12-19 05:20:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265443866] [2019-12-19 05:20:41,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:41,008 INFO L87 Difference]: Start difference. First operand 32360 states and 100100 transitions. Second operand 6 states. [2019-12-19 05:20:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:41,518 INFO L93 Difference]: Finished difference Result 33657 states and 103522 transitions. [2019-12-19 05:20:41,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:41,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:20:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:41,569 INFO L225 Difference]: With dead ends: 33657 [2019-12-19 05:20:41,569 INFO L226 Difference]: Without dead ends: 33657 [2019-12-19 05:20:41,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33657 states. [2019-12-19 05:20:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33657 to 32960. [2019-12-19 05:20:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32960 states. [2019-12-19 05:20:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32960 states to 32960 states and 101659 transitions. [2019-12-19 05:20:42,019 INFO L78 Accepts]: Start accepts. Automaton has 32960 states and 101659 transitions. Word has length 80 [2019-12-19 05:20:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:42,019 INFO L462 AbstractCegarLoop]: Abstraction has 32960 states and 101659 transitions. [2019-12-19 05:20:42,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32960 states and 101659 transitions. [2019-12-19 05:20:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:42,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:42,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] [2019-12-19 05:20:42,051 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash 332600451, now seen corresponding path program 1 times [2019-12-19 05:20:42,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:42,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736238131] [2019-12-19 05:20:42,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:42,132 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-19 05:20:42,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736238131] [2019-12-19 05:20:42,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:42,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:42,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976364098] [2019-12-19 05:20:42,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:42,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:42,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:42,135 INFO L87 Difference]: Start difference. First operand 32960 states and 101659 transitions. Second operand 5 states. [2019-12-19 05:20:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:42,180 INFO L93 Difference]: Finished difference Result 4187 states and 10306 transitions. [2019-12-19 05:20:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:42,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:20:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:42,186 INFO L225 Difference]: With dead ends: 4187 [2019-12-19 05:20:42,186 INFO L226 Difference]: Without dead ends: 3449 [2019-12-19 05:20:42,186 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-19 05:20:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2019-12-19 05:20:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3179. [2019-12-19 05:20:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2019-12-19 05:20:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 7713 transitions. [2019-12-19 05:20:42,238 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 7713 transitions. Word has length 80 [2019-12-19 05:20:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:42,239 INFO L462 AbstractCegarLoop]: Abstraction has 3179 states and 7713 transitions. [2019-12-19 05:20:42,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 7713 transitions. [2019-12-19 05:20:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-19 05:20:42,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:42,243 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] [2019-12-19 05:20:42,243 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash -171156109, now seen corresponding path program 1 times [2019-12-19 05:20:42,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:42,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49871068] [2019-12-19 05:20:42,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:20:42,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49871068] [2019-12-19 05:20:42,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:42,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:42,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386779193] [2019-12-19 05:20:42,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:42,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:42,343 INFO L87 Difference]: Start difference. First operand 3179 states and 7713 transitions. Second operand 6 states. [2019-12-19 05:20:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:42,734 INFO L93 Difference]: Finished difference Result 3451 states and 8306 transitions. [2019-12-19 05:20:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:42,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-12-19 05:20:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:42,740 INFO L225 Difference]: With dead ends: 3451 [2019-12-19 05:20:42,740 INFO L226 Difference]: Without dead ends: 3393 [2019-12-19 05:20:42,741 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-19 05:20:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2019-12-19 05:20:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3131. [2019-12-19 05:20:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2019-12-19 05:20:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 7597 transitions. [2019-12-19 05:20:42,772 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 7597 transitions. Word has length 90 [2019-12-19 05:20:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:42,772 INFO L462 AbstractCegarLoop]: Abstraction has 3131 states and 7597 transitions. [2019-12-19 05:20:42,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 7597 transitions. [2019-12-19 05:20:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-19 05:20:42,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:42,775 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] [2019-12-19 05:20:42,775 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1799783348, now seen corresponding path program 1 times [2019-12-19 05:20:42,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:42,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039958850] [2019-12-19 05:20:42,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:42,842 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-19 05:20:42,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039958850] [2019-12-19 05:20:42,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:42,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:42,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210066734] [2019-12-19 05:20:42,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:42,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:42,844 INFO L87 Difference]: Start difference. First operand 3131 states and 7597 transitions. Second operand 5 states. [2019-12-19 05:20:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,056 INFO L93 Difference]: Finished difference Result 3630 states and 8714 transitions. [2019-12-19 05:20:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:43,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-12-19 05:20:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,061 INFO L225 Difference]: With dead ends: 3630 [2019-12-19 05:20:43,062 INFO L226 Difference]: Without dead ends: 3589 [2019-12-19 05:20:43,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2019-12-19 05:20:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3304. [2019-12-19 05:20:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2019-12-19 05:20:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 7985 transitions. [2019-12-19 05:20:43,095 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 7985 transitions. Word has length 90 [2019-12-19 05:20:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,096 INFO L462 AbstractCegarLoop]: Abstraction has 3304 states and 7985 transitions. [2019-12-19 05:20:43,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 7985 transitions. [2019-12-19 05:20:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,099 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] [2019-12-19 05:20:43,099 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2051379953, now seen corresponding path program 1 times [2019-12-19 05:20:43,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412845023] [2019-12-19 05:20:43,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:43,145 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-19 05:20:43,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412845023] [2019-12-19 05:20:43,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:43,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:43,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850298107] [2019-12-19 05:20:43,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:43,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:43,147 INFO L87 Difference]: Start difference. First operand 3304 states and 7985 transitions. Second operand 4 states. [2019-12-19 05:20:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,293 INFO L93 Difference]: Finished difference Result 5040 states and 12287 transitions. [2019-12-19 05:20:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:43,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-19 05:20:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,300 INFO L225 Difference]: With dead ends: 5040 [2019-12-19 05:20:43,300 INFO L226 Difference]: Without dead ends: 5015 [2019-12-19 05:20:43,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:43,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2019-12-19 05:20:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 3034. [2019-12-19 05:20:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-19 05:20:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 7258 transitions. [2019-12-19 05:20:43,357 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 7258 transitions. Word has length 92 [2019-12-19 05:20:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,358 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 7258 transitions. [2019-12-19 05:20:43,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 7258 transitions. [2019-12-19 05:20:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,362 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] [2019-12-19 05:20:43,362 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,363 INFO L82 PathProgramCache]: Analyzing trace with hash -175095664, now seen corresponding path program 1 times [2019-12-19 05:20:43,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736688373] [2019-12-19 05:20:43,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:43,501 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-19 05:20:43,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736688373] [2019-12-19 05:20:43,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:43,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:43,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665597993] [2019-12-19 05:20:43,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:43,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:43,504 INFO L87 Difference]: Start difference. First operand 3034 states and 7258 transitions. Second operand 7 states. [2019-12-19 05:20:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,887 INFO L93 Difference]: Finished difference Result 2661 states and 6313 transitions. [2019-12-19 05:20:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:43,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:20:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,892 INFO L225 Difference]: With dead ends: 2661 [2019-12-19 05:20:43,892 INFO L226 Difference]: Without dead ends: 2661 [2019-12-19 05:20:43,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:20:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2019-12-19 05:20:43,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2605. [2019-12-19 05:20:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-19 05:20:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 6199 transitions. [2019-12-19 05:20:43,919 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 6199 transitions. Word has length 92 [2019-12-19 05:20:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,919 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 6199 transitions. [2019-12-19 05:20:43,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 6199 transitions. [2019-12-19 05:20:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,923 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] [2019-12-19 05:20:43,923 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash -869143036, now seen corresponding path program 1 times [2019-12-19 05:20:43,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210631412] [2019-12-19 05:20:43,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:44,056 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-19 05:20:44,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210631412] [2019-12-19 05:20:44,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:44,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880542569] [2019-12-19 05:20:44,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:44,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:44,058 INFO L87 Difference]: Start difference. First operand 2605 states and 6199 transitions. Second operand 6 states. [2019-12-19 05:20:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:44,288 INFO L93 Difference]: Finished difference Result 2899 states and 6768 transitions. [2019-12-19 05:20:44,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:20:44,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:44,292 INFO L225 Difference]: With dead ends: 2899 [2019-12-19 05:20:44,293 INFO L226 Difference]: Without dead ends: 2871 [2019-12-19 05:20:44,293 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-19 05:20:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-12-19 05:20:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2630. [2019-12-19 05:20:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-12-19 05:20:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6222 transitions. [2019-12-19 05:20:44,331 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6222 transitions. Word has length 92 [2019-12-19 05:20:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:44,331 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 6222 transitions. [2019-12-19 05:20:44,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6222 transitions. [2019-12-19 05:20:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:44,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:44,335 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] [2019-12-19 05:20:44,335 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1404367329, now seen corresponding path program 1 times [2019-12-19 05:20:44,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:44,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404365109] [2019-12-19 05:20:44,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:44,417 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-19 05:20:44,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404365109] [2019-12-19 05:20:44,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:44,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:44,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386279143] [2019-12-19 05:20:44,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:44,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:44,419 INFO L87 Difference]: Start difference. First operand 2630 states and 6222 transitions. Second operand 6 states. [2019-12-19 05:20:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:44,755 INFO L93 Difference]: Finished difference Result 4556 states and 11002 transitions. [2019-12-19 05:20:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:44,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:44,762 INFO L225 Difference]: With dead ends: 4556 [2019-12-19 05:20:44,762 INFO L226 Difference]: Without dead ends: 4556 [2019-12-19 05:20:44,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2019-12-19 05:20:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2639. [2019-12-19 05:20:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-19 05:20:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 6247 transitions. [2019-12-19 05:20:44,813 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 6247 transitions. Word has length 92 [2019-12-19 05:20:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:44,814 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 6247 transitions. [2019-12-19 05:20:44,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 6247 transitions. [2019-12-19 05:20:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:44,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:44,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:20:44,818 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1528440576, now seen corresponding path program 1 times [2019-12-19 05:20:44,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:44,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698835677] [2019-12-19 05:20:44,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:44,932 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-19 05:20:44,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698835677] [2019-12-19 05:20:44,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:44,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:44,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474245635] [2019-12-19 05:20:44,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:44,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:44,934 INFO L87 Difference]: Start difference. First operand 2639 states and 6247 transitions. Second operand 7 states. [2019-12-19 05:20:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:45,357 INFO L93 Difference]: Finished difference Result 3614 states and 8478 transitions. [2019-12-19 05:20:45,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:20:45,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:20:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:45,363 INFO L225 Difference]: With dead ends: 3614 [2019-12-19 05:20:45,364 INFO L226 Difference]: Without dead ends: 3578 [2019-12-19 05:20:45,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:20:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-12-19 05:20:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 2693. [2019-12-19 05:20:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2019-12-19 05:20:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 6367 transitions. [2019-12-19 05:20:45,401 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 6367 transitions. Word has length 92 [2019-12-19 05:20:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:45,402 INFO L462 AbstractCegarLoop]: Abstraction has 2693 states and 6367 transitions. [2019-12-19 05:20:45,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 6367 transitions. [2019-12-19 05:20:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:45,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:45,404 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] [2019-12-19 05:20:45,405 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1245290112, now seen corresponding path program 1 times [2019-12-19 05:20:45,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:45,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283745878] [2019-12-19 05:20:45,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:45,503 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-19 05:20:45,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283745878] [2019-12-19 05:20:45,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:45,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:45,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256317431] [2019-12-19 05:20:45,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:45,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:45,505 INFO L87 Difference]: Start difference. First operand 2693 states and 6367 transitions. Second operand 7 states. [2019-12-19 05:20:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:45,926 INFO L93 Difference]: Finished difference Result 3512 states and 8279 transitions. [2019-12-19 05:20:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:45,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:20:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:45,931 INFO L225 Difference]: With dead ends: 3512 [2019-12-19 05:20:45,932 INFO L226 Difference]: Without dead ends: 3512 [2019-12-19 05:20:45,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:20:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2019-12-19 05:20:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 2929. [2019-12-19 05:20:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2019-12-19 05:20:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 6957 transitions. [2019-12-19 05:20:45,989 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 6957 transitions. Word has length 92 [2019-12-19 05:20:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:45,989 INFO L462 AbstractCegarLoop]: Abstraction has 2929 states and 6957 transitions. [2019-12-19 05:20:45,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 6957 transitions. [2019-12-19 05:20:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:45,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:45,995 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] [2019-12-19 05:20:45,996 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1804912703, now seen corresponding path program 1 times [2019-12-19 05:20:45,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:45,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35948312] [2019-12-19 05:20:45,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:46,080 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-19 05:20:46,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35948312] [2019-12-19 05:20:46,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:46,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:46,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22632321] [2019-12-19 05:20:46,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:46,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:46,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:46,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:46,083 INFO L87 Difference]: Start difference. First operand 2929 states and 6957 transitions. Second operand 6 states. [2019-12-19 05:20:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:46,298 INFO L93 Difference]: Finished difference Result 2969 states and 7017 transitions. [2019-12-19 05:20:46,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:46,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:46,303 INFO L225 Difference]: With dead ends: 2969 [2019-12-19 05:20:46,303 INFO L226 Difference]: Without dead ends: 2969 [2019-12-19 05:20:46,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-12-19 05:20:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2952. [2019-12-19 05:20:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-19 05:20:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 6982 transitions. [2019-12-19 05:20:46,350 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 6982 transitions. Word has length 92 [2019-12-19 05:20:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:46,351 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 6982 transitions. [2019-12-19 05:20:46,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 6982 transitions. [2019-12-19 05:20:46,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:46,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:46,355 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] [2019-12-19 05:20:46,356 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:46,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1090876316, now seen corresponding path program 1 times [2019-12-19 05:20:46,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:46,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757589166] [2019-12-19 05:20:46,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:46,465 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-19 05:20:46,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757589166] [2019-12-19 05:20:46,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:46,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:46,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207288825] [2019-12-19 05:20:46,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:46,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:46,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:46,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:46,469 INFO L87 Difference]: Start difference. First operand 2952 states and 6982 transitions. Second operand 5 states. [2019-12-19 05:20:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:46,595 INFO L93 Difference]: Finished difference Result 2703 states and 6399 transitions. [2019-12-19 05:20:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:46,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:20:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:46,599 INFO L225 Difference]: With dead ends: 2703 [2019-12-19 05:20:46,599 INFO L226 Difference]: Without dead ends: 2703 [2019-12-19 05:20:46,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-19 05:20:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2653. [2019-12-19 05:20:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-12-19 05:20:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6303 transitions. [2019-12-19 05:20:46,648 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6303 transitions. Word has length 92 [2019-12-19 05:20:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:46,648 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 6303 transitions. [2019-12-19 05:20:46,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6303 transitions. [2019-12-19 05:20:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:46,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:46,652 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] [2019-12-19 05:20:46,652 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:46,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1928417086, now seen corresponding path program 1 times [2019-12-19 05:20:46,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:46,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783974667] [2019-12-19 05:20:46,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:46,777 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-19 05:20:46,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783974667] [2019-12-19 05:20:46,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:46,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:46,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684057609] [2019-12-19 05:20:46,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:46,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:46,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:46,779 INFO L87 Difference]: Start difference. First operand 2653 states and 6303 transitions. Second operand 6 states. [2019-12-19 05:20:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:46,889 INFO L93 Difference]: Finished difference Result 2473 states and 5721 transitions. [2019-12-19 05:20:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:46,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:46,894 INFO L225 Difference]: With dead ends: 2473 [2019-12-19 05:20:46,894 INFO L226 Difference]: Without dead ends: 2473 [2019-12-19 05:20:46,895 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-19 05:20:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2019-12-19 05:20:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 1816. [2019-12-19 05:20:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-12-19 05:20:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 4273 transitions. [2019-12-19 05:20:46,930 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 4273 transitions. Word has length 92 [2019-12-19 05:20:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:46,930 INFO L462 AbstractCegarLoop]: Abstraction has 1816 states and 4273 transitions. [2019-12-19 05:20:46,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 4273 transitions. [2019-12-19 05:20:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:46,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:46,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:46,934 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1154922491, now seen corresponding path program 1 times [2019-12-19 05:20:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:46,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329064487] [2019-12-19 05:20:46,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,041 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-19 05:20:47,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329064487] [2019-12-19 05:20:47,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:47,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110045169] [2019-12-19 05:20:47,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:47,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:47,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:47,044 INFO L87 Difference]: Start difference. First operand 1816 states and 4273 transitions. Second operand 5 states. [2019-12-19 05:20:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,247 INFO L93 Difference]: Finished difference Result 2068 states and 4852 transitions. [2019-12-19 05:20:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:20:47,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:20:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,253 INFO L225 Difference]: With dead ends: 2068 [2019-12-19 05:20:47,253 INFO L226 Difference]: Without dead ends: 2050 [2019-12-19 05:20:47,254 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-19 05:20:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2019-12-19 05:20:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1843. [2019-12-19 05:20:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-12-19 05:20:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4327 transitions. [2019-12-19 05:20:47,282 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4327 transitions. Word has length 94 [2019-12-19 05:20:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,282 INFO L462 AbstractCegarLoop]: Abstraction has 1843 states and 4327 transitions. [2019-12-19 05:20:47,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4327 transitions. [2019-12-19 05:20:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:47,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,285 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] [2019-12-19 05:20:47,285 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 89841990, now seen corresponding path program 1 times [2019-12-19 05:20:47,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914692796] [2019-12-19 05:20:47,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,435 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-19 05:20:47,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914692796] [2019-12-19 05:20:47,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:47,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079407465] [2019-12-19 05:20:47,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:47,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:47,441 INFO L87 Difference]: Start difference. First operand 1843 states and 4327 transitions. Second operand 6 states. [2019-12-19 05:20:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,526 INFO L93 Difference]: Finished difference Result 2968 states and 7090 transitions. [2019-12-19 05:20:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:47,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 05:20:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,530 INFO L225 Difference]: With dead ends: 2968 [2019-12-19 05:20:47,530 INFO L226 Difference]: Without dead ends: 1192 [2019-12-19 05:20:47,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:20:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-19 05:20:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-19 05:20:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-19 05:20:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2866 transitions. [2019-12-19 05:20:47,551 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2866 transitions. Word has length 94 [2019-12-19 05:20:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,551 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 2866 transitions. [2019-12-19 05:20:47,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2866 transitions. [2019-12-19 05:20:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:47,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,554 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] [2019-12-19 05:20:47,555 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash 104916029, now seen corresponding path program 1 times [2019-12-19 05:20:47,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216398595] [2019-12-19 05:20:47,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,648 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-19 05:20:47,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216398595] [2019-12-19 05:20:47,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:47,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354241099] [2019-12-19 05:20:47,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:47,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:47,650 INFO L87 Difference]: Start difference. First operand 1192 states and 2866 transitions. Second operand 5 states. [2019-12-19 05:20:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,684 INFO L93 Difference]: Finished difference Result 1192 states and 2845 transitions. [2019-12-19 05:20:47,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:47,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:20:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,686 INFO L225 Difference]: With dead ends: 1192 [2019-12-19 05:20:47,686 INFO L226 Difference]: Without dead ends: 1192 [2019-12-19 05:20:47,687 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-19 05:20:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-19 05:20:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-19 05:20:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-19 05:20:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 2845 transitions. [2019-12-19 05:20:47,702 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 2845 transitions. Word has length 94 [2019-12-19 05:20:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,702 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 2845 transitions. [2019-12-19 05:20:47,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 2845 transitions. [2019-12-19 05:20:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:47,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,704 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] [2019-12-19 05:20:47,704 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -919777892, now seen corresponding path program 2 times [2019-12-19 05:20:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381901646] [2019-12-19 05:20:47,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,848 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-19 05:20:47,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381901646] [2019-12-19 05:20:47,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 05:20:47,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218097584] [2019-12-19 05:20:47,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 05:20:47,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 05:20:47,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:20:47,852 INFO L87 Difference]: Start difference. First operand 1192 states and 2845 transitions. Second operand 11 states. [2019-12-19 05:20:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:48,088 INFO L93 Difference]: Finished difference Result 2291 states and 5520 transitions. [2019-12-19 05:20:48,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:20:48,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-19 05:20:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:48,091 INFO L225 Difference]: With dead ends: 2291 [2019-12-19 05:20:48,091 INFO L226 Difference]: Without dead ends: 1652 [2019-12-19 05:20:48,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:20:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-12-19 05:20:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1558. [2019-12-19 05:20:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-12-19 05:20:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 3612 transitions. [2019-12-19 05:20:48,116 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 3612 transitions. Word has length 94 [2019-12-19 05:20:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:48,117 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 3612 transitions. [2019-12-19 05:20:48,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 05:20:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 3612 transitions. [2019-12-19 05:20:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:48,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:48,120 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] [2019-12-19 05:20:48,120 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:48,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1370490878, now seen corresponding path program 3 times [2019-12-19 05:20:48,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:48,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685344089] [2019-12-19 05:20:48,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:20:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:20:48,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:20:48,254 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:20:48,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:20:48 BasicIcfg [2019-12-19 05:20:48,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:20:48,447 INFO L168 Benchmark]: Toolchain (without parser) took 57445.49 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 101.4 MB in the beginning and 1.0 GB in the end (delta: -936.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,447 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.78 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 155.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.39 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,448 INFO L168 Benchmark]: Boogie Preprocessor took 42.29 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,449 INFO L168 Benchmark]: RCFGBuilder took 820.70 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 106.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,449 INFO L168 Benchmark]: TraceAbstraction took 55707.34 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.5 MB in the beginning and 1.0 GB in the end (delta: -931.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,451 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.49 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.78 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 155.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.39 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.29 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.70 ms. Allocated memory is still 201.3 MB. Free memory was 150.3 MB in the beginning and 106.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55707.34 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.5 MB in the beginning and 1.0 GB in the end (delta: -931.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L714] 0 int y = 0; VAL [__unbuffered_cnt=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] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L776] 0 pthread_t t2479; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] 0 pthread_t t2480; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=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] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=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] [L754] 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, 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] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L754] 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) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2] [L726] 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, 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=2] [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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, 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_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 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, 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_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=2] [L728] 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 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] 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, 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_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=2] [L730] 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 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 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, 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=2] [L756] 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 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, 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=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] 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, 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=2] [L758] 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 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, 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=2] [L785] 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, 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=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, 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=2] [L785] 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, 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=2] [L785] 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) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, 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=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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, 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=2] [L787] 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 [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, 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=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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, 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=2] [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, 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=2] [L796] 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, 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=2] [L796] 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) [L797] 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, 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=2] [L797] 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)) [L798] 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, 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=2] [L798] 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)) [L799] 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, 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=2] [L799] 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)) [L800] 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, 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=2] [L800] 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)) [L801] 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, 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=2] [L801] 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)) [L802] 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, 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=2] [L802] 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)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, 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=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, 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=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, 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=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, 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=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.3s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9973 SDtfs, 9697 SDslu, 23220 SDs, 0 SdLazy, 10525 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 107 SyntacticMatches, 23 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76077occurred 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: 25.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 111775 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2970 NumberOfCodeBlocks, 2970 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2839 ConstructedInterpolants, 0 QuantifiedInterpolants, 519052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...