/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:35:31,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:35:31,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:35:31,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:35:31,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:35:31,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:35:31,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:35:31,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:35:31,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:35:31,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:35:31,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:35:31,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:35:31,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:35:31,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:35:31,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:35:31,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:35:31,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:35:31,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:35:31,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:35:31,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:35:31,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:35:31,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:35:31,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:35:31,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:35:31,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:35:31,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:35:31,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:35:31,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:35:31,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:35:31,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:35:31,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:35:31,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:35:31,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:35:31,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:35:31,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:35:31,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:35:31,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:35:31,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:35:31,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:35:31,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:35:31,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:35:31,598 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 02:35:31,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:35:31,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:35:31,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:35:31,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:35:31,637 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:35:31,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:35:31,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:35:31,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:35:31,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:35:31,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:35:31,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:35:31,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:35:31,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:35:31,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:35:31,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:35:31,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:35:31,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:35:31,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:35:31,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:35:31,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:35:31,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:35:31,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:35:31,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:35:31,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:35:31,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:35:31,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:35:31,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:35:31,645 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:35:31,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:35:31,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:35:31,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:35:31,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:35:31,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:35:31,956 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:35:31,956 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:35:31,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-19 02:35:32,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0138dc559/900ca658aae844d9a4e0605f3be39a3f/FLAGd701aa2e3 [2019-12-19 02:35:32,630 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:35:32,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-19 02:35:32,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0138dc559/900ca658aae844d9a4e0605f3be39a3f/FLAGd701aa2e3 [2019-12-19 02:35:32,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0138dc559/900ca658aae844d9a4e0605f3be39a3f [2019-12-19 02:35:32,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:35:32,898 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:35:32,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:35:32,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:35:32,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:35:32,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:35:32" (1/1) ... [2019-12-19 02:35:32,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@992f245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:32, skipping insertion in model container [2019-12-19 02:35:32,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:35:32" (1/1) ... [2019-12-19 02:35:32,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:35:32,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:35:33,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:35:33,548 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:35:33,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:35:33,686 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:35:33,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33 WrapperNode [2019-12-19 02:35:33,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:35:33,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:35:33,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:35:33,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:35:33,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:35:33,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:35:33,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:35:33,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:35:33,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (1/1) ... [2019-12-19 02:35:33,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:35:33,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:35:33,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:35:33,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:35:33,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (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 02:35:33,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:35:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:35:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:35:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:35:33,917 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:35:33,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:35:33,918 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:35:33,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:35:33,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:35:33,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:35:33,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:35:33,920 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 02:35:34,596 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:35:34,597 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:35:34,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:35:34 BoogieIcfgContainer [2019-12-19 02:35:34,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:35:34,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:35:34,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:35:34,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:35:34,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:35:32" (1/3) ... [2019-12-19 02:35:34,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6764aab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:35:34, skipping insertion in model container [2019-12-19 02:35:34,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:35:33" (2/3) ... [2019-12-19 02:35:34,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6764aab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:35:34, skipping insertion in model container [2019-12-19 02:35:34,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:35:34" (3/3) ... [2019-12-19 02:35:34,607 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.oepc.i [2019-12-19 02:35:34,617 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:35:34,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:35:34,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:35:34,628 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:35:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,681 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,706 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,707 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:35:34,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:35:34,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:35:34,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:35:34,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:35:34,761 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:35:34,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:35:34,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:35:34,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:35:34,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:35:34,782 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 02:35:36,001 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-19 02:35:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-19 02:35:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 02:35:36,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:36,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:36,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 697146637, now seen corresponding path program 1 times [2019-12-19 02:35:36,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:36,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532638936] [2019-12-19 02:35:36,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:36,410 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 02:35:36,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532638936] [2019-12-19 02:35:36,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:36,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:35:36,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423620435] [2019-12-19 02:35:36,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:35:36,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:35:36,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:35:36,442 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-19 02:35:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:37,004 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-19 02:35:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:35:37,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 02:35:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:37,324 INFO L225 Difference]: With dead ends: 23448 [2019-12-19 02:35:37,325 INFO L226 Difference]: Without dead ends: 21272 [2019-12-19 02:35:37,328 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 02:35:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-19 02:35:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-19 02:35:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-19 02:35:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-19 02:35:39,357 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-19 02:35:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:39,358 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-19 02:35:39,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:35:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-19 02:35:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 02:35:39,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:39,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:39,382 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1403469956, now seen corresponding path program 1 times [2019-12-19 02:35:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:39,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311640604] [2019-12-19 02:35:39,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:39,567 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 02:35:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311640604] [2019-12-19 02:35:39,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:39,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:39,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346218648] [2019-12-19 02:35:39,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:39,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:39,572 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-19 02:35:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:40,843 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-19 02:35:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:40,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 02:35:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:40,999 INFO L225 Difference]: With dead ends: 34706 [2019-12-19 02:35:40,999 INFO L226 Difference]: Without dead ends: 34562 [2019-12-19 02:35:41,000 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 02:35:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-19 02:35:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-19 02:35:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-19 02:35:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-19 02:35:43,350 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-19 02:35:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:43,355 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-19 02:35:43,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-19 02:35:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 02:35:43,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:43,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:43,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 227456424, now seen corresponding path program 1 times [2019-12-19 02:35:43,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:43,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635710662] [2019-12-19 02:35:43,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:43,455 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 02:35:43,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635710662] [2019-12-19 02:35:43,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:43,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:35:43,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120938465] [2019-12-19 02:35:43,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:35:43,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:35:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:35:43,458 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-19 02:35:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:44,032 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-19 02:35:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:35:44,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 02:35:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:44,624 INFO L225 Difference]: With dead ends: 40214 [2019-12-19 02:35:44,624 INFO L226 Difference]: Without dead ends: 40054 [2019-12-19 02:35:44,625 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 02:35:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-19 02:35:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-19 02:35:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-19 02:35:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-19 02:35:47,153 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-19 02:35:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:47,154 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-19 02:35:47,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:35:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-19 02:35:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 02:35:47,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:47,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:47,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -171706089, now seen corresponding path program 1 times [2019-12-19 02:35:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:47,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992812042] [2019-12-19 02:35:47,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:47,277 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 02:35:47,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992812042] [2019-12-19 02:35:47,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:47,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:47,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004508201] [2019-12-19 02:35:47,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:47,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:47,280 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-19 02:35:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:48,494 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-19 02:35:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:35:48,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 02:35:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:48,631 INFO L225 Difference]: With dead ends: 45663 [2019-12-19 02:35:48,631 INFO L226 Difference]: Without dead ends: 45519 [2019-12-19 02:35:48,632 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 02:35:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-19 02:35:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-19 02:35:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-19 02:35:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-19 02:35:51,131 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-19 02:35:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:51,131 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-19 02:35:51,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-19 02:35:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 02:35:51,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:51,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:51,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:51,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1292892266, now seen corresponding path program 1 times [2019-12-19 02:35:51,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:51,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540543751] [2019-12-19 02:35:51,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:51,249 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 02:35:51,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540543751] [2019-12-19 02:35:51,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:51,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:35:51,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536265913] [2019-12-19 02:35:51,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:35:51,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:35:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:35:51,252 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-19 02:35:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:52,248 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-19 02:35:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:35:52,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 02:35:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:52,350 INFO L225 Difference]: With dead ends: 46070 [2019-12-19 02:35:52,350 INFO L226 Difference]: Without dead ends: 45830 [2019-12-19 02:35:52,350 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 02:35:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-19 02:35:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-19 02:35:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-19 02:35:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-19 02:35:54,856 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-19 02:35:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:54,856 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-19 02:35:54,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:35:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-19 02:35:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:35:54,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:54,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:35:54,891 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:54,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 43524005, now seen corresponding path program 1 times [2019-12-19 02:35:54,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:54,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124403212] [2019-12-19 02:35:54,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:54,946 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 02:35:54,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124403212] [2019-12-19 02:35:54,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:54,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:35:54,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825089396] [2019-12-19 02:35:54,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:35:54,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:35:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:35:54,948 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-19 02:35:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:55,213 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-19 02:35:55,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:35:55,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-19 02:35:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:55,324 INFO L225 Difference]: With dead ends: 50257 [2019-12-19 02:35:55,324 INFO L226 Difference]: Without dead ends: 50257 [2019-12-19 02:35:55,324 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 02:35:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-19 02:35:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-19 02:35:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-19 02:35:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-19 02:35:56,499 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-19 02:35:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:35:56,499 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-19 02:35:56,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:35:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-19 02:35:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:35:56,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:35:56,534 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 02:35:56,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:35:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:35:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash -41034466, now seen corresponding path program 1 times [2019-12-19 02:35:56,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:35:56,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804803842] [2019-12-19 02:35:56,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:35:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:35:56,628 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 02:35:56,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804803842] [2019-12-19 02:35:56,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:35:56,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:35:56,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380889808] [2019-12-19 02:35:56,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:35:56,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:35:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:35:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:35:56,631 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-19 02:35:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:35:57,951 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-19 02:35:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:35:57,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 02:35:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:35:58,071 INFO L225 Difference]: With dead ends: 55885 [2019-12-19 02:35:58,071 INFO L226 Difference]: Without dead ends: 55645 [2019-12-19 02:35:58,072 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 02:35:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-19 02:36:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-19 02:36:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-19 02:36:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-19 02:36:00,793 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-19 02:36:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-19 02:36:00,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:36:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-19 02:36:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 02:36:00,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:00,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:00,830 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -44622651, now seen corresponding path program 1 times [2019-12-19 02:36:00,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:00,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045034318] [2019-12-19 02:36:00,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:00,939 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 02:36:00,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045034318] [2019-12-19 02:36:00,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:00,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:36:00,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091047771] [2019-12-19 02:36:00,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:36:00,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:36:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:00,942 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-19 02:36:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:02,461 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-19 02:36:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:36:02,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 02:36:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:02,591 INFO L225 Difference]: With dead ends: 55099 [2019-12-19 02:36:02,591 INFO L226 Difference]: Without dead ends: 54899 [2019-12-19 02:36:02,592 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 02:36:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-19 02:36:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-19 02:36:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-19 02:36:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-19 02:36:04,052 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-19 02:36:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:04,053 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-19 02:36:04,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:36:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-19 02:36:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:36:04,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:04,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:04,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash 500322373, now seen corresponding path program 1 times [2019-12-19 02:36:04,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:04,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126198843] [2019-12-19 02:36:04,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:04,251 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 02:36:04,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126198843] [2019-12-19 02:36:04,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:04,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:04,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763977860] [2019-12-19 02:36:04,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:04,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:04,256 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-19 02:36:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:05,018 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-19 02:36:05,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:36:05,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 02:36:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:05,151 INFO L225 Difference]: With dead ends: 65553 [2019-12-19 02:36:05,151 INFO L226 Difference]: Without dead ends: 64909 [2019-12-19 02:36:05,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:36:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-19 02:36:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-19 02:36:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-19 02:36:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-19 02:36:08,363 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-19 02:36:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:08,363 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-19 02:36:08,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-19 02:36:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:36:08,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:08,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:08,416 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1461936390, now seen corresponding path program 1 times [2019-12-19 02:36:08,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:08,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300005502] [2019-12-19 02:36:08,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:08,548 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 02:36:08,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300005502] [2019-12-19 02:36:08,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:08,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:36:08,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693351569] [2019-12-19 02:36:08,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:36:08,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:36:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:08,550 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-19 02:36:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:10,131 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-19 02:36:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:36:10,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 02:36:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:10,317 INFO L225 Difference]: With dead ends: 83031 [2019-12-19 02:36:10,317 INFO L226 Difference]: Without dead ends: 83031 [2019-12-19 02:36:10,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:36:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-19 02:36:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-19 02:36:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-19 02:36:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-19 02:36:12,184 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-19 02:36:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:12,185 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-19 02:36:12,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:36:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-19 02:36:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 02:36:12,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:12,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:12,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1588266425, now seen corresponding path program 1 times [2019-12-19 02:36:12,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:12,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671542293] [2019-12-19 02:36:12,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:12,363 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 02:36:12,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671542293] [2019-12-19 02:36:12,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:12,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:36:12,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015965511] [2019-12-19 02:36:12,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:36:12,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:36:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:36:12,366 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 4 states. [2019-12-19 02:36:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:12,473 INFO L93 Difference]: Finished difference Result 17225 states and 54507 transitions. [2019-12-19 02:36:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:36:12,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-19 02:36:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:12,511 INFO L225 Difference]: With dead ends: 17225 [2019-12-19 02:36:12,511 INFO L226 Difference]: Without dead ends: 16747 [2019-12-19 02:36:12,512 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 02:36:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16747 states. [2019-12-19 02:36:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16747 to 16735. [2019-12-19 02:36:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16735 states. [2019-12-19 02:36:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 53002 transitions. [2019-12-19 02:36:12,804 INFO L78 Accepts]: Start accepts. Automaton has 16735 states and 53002 transitions. Word has length 70 [2019-12-19 02:36:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:12,804 INFO L462 AbstractCegarLoop]: Abstraction has 16735 states and 53002 transitions. [2019-12-19 02:36:12,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:36:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16735 states and 53002 transitions. [2019-12-19 02:36:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:36:12,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:12,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] [2019-12-19 02:36:12,817 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash -977177849, now seen corresponding path program 1 times [2019-12-19 02:36:12,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:12,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973577532] [2019-12-19 02:36:12,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:12,881 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 02:36:12,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973577532] [2019-12-19 02:36:12,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:12,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:36:12,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865011238] [2019-12-19 02:36:12,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:36:12,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:12,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:36:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:36:12,884 INFO L87 Difference]: Start difference. First operand 16735 states and 53002 transitions. Second operand 4 states. [2019-12-19 02:36:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:13,723 INFO L93 Difference]: Finished difference Result 22099 states and 69083 transitions. [2019-12-19 02:36:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:36:13,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 02:36:13,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:13,757 INFO L225 Difference]: With dead ends: 22099 [2019-12-19 02:36:13,757 INFO L226 Difference]: Without dead ends: 22099 [2019-12-19 02:36:13,757 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 02:36:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22099 states. [2019-12-19 02:36:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22099 to 17611. [2019-12-19 02:36:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17611 states. [2019-12-19 02:36:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17611 states to 17611 states and 55561 transitions. [2019-12-19 02:36:14,018 INFO L78 Accepts]: Start accepts. Automaton has 17611 states and 55561 transitions. Word has length 80 [2019-12-19 02:36:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:14,019 INFO L462 AbstractCegarLoop]: Abstraction has 17611 states and 55561 transitions. [2019-12-19 02:36:14,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:36:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17611 states and 55561 transitions. [2019-12-19 02:36:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 02:36:14,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:14,032 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 02:36:14,033 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1231914394, now seen corresponding path program 1 times [2019-12-19 02:36:14,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944678526] [2019-12-19 02:36:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:14,180 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 02:36:14,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944678526] [2019-12-19 02:36:14,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:14,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:36:14,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159937048] [2019-12-19 02:36:14,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:36:14,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:14,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:36:14,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:36:14,182 INFO L87 Difference]: Start difference. First operand 17611 states and 55561 transitions. Second operand 8 states. [2019-12-19 02:36:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:15,348 INFO L93 Difference]: Finished difference Result 19705 states and 61637 transitions. [2019-12-19 02:36:15,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 02:36:15,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 02:36:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:15,379 INFO L225 Difference]: With dead ends: 19705 [2019-12-19 02:36:15,379 INFO L226 Difference]: Without dead ends: 19657 [2019-12-19 02:36:15,380 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 02:36:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19657 states. [2019-12-19 02:36:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19657 to 15529. [2019-12-19 02:36:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-12-19 02:36:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 49295 transitions. [2019-12-19 02:36:15,616 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 49295 transitions. Word has length 80 [2019-12-19 02:36:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:15,617 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 49295 transitions. [2019-12-19 02:36:15,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:36:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 49295 transitions. [2019-12-19 02:36:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 02:36:15,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:15,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:15,636 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:15,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash 480666418, now seen corresponding path program 1 times [2019-12-19 02:36:15,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:15,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591530401] [2019-12-19 02:36:15,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:15,678 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 02:36:15,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591530401] [2019-12-19 02:36:15,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:15,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:36:15,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350869357] [2019-12-19 02:36:15,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:36:15,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:36:15,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:36:15,680 INFO L87 Difference]: Start difference. First operand 15529 states and 49295 transitions. Second operand 3 states. [2019-12-19 02:36:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:15,990 INFO L93 Difference]: Finished difference Result 16793 states and 53008 transitions. [2019-12-19 02:36:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:36:15,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-19 02:36:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:16,025 INFO L225 Difference]: With dead ends: 16793 [2019-12-19 02:36:16,026 INFO L226 Difference]: Without dead ends: 16793 [2019-12-19 02:36:16,026 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 02:36:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2019-12-19 02:36:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 16145. [2019-12-19 02:36:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16145 states. [2019-12-19 02:36:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 51109 transitions. [2019-12-19 02:36:16,453 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 51109 transitions. Word has length 81 [2019-12-19 02:36:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:16,453 INFO L462 AbstractCegarLoop]: Abstraction has 16145 states and 51109 transitions. [2019-12-19 02:36:16,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:36:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 51109 transitions. [2019-12-19 02:36:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 02:36:16,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:16,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:16,468 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 678513047, now seen corresponding path program 1 times [2019-12-19 02:36:16,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:16,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310694701] [2019-12-19 02:36:16,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:16,528 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 02:36:16,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310694701] [2019-12-19 02:36:16,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:16,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:36:16,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313995959] [2019-12-19 02:36:16,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:36:16,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:36:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:36:16,530 INFO L87 Difference]: Start difference. First operand 16145 states and 51109 transitions. Second operand 4 states. [2019-12-19 02:36:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:16,828 INFO L93 Difference]: Finished difference Result 19273 states and 60155 transitions. [2019-12-19 02:36:16,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:36:16,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-19 02:36:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:16,858 INFO L225 Difference]: With dead ends: 19273 [2019-12-19 02:36:16,858 INFO L226 Difference]: Without dead ends: 19273 [2019-12-19 02:36:16,858 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 02:36:16,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2019-12-19 02:36:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 18250. [2019-12-19 02:36:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18250 states. [2019-12-19 02:36:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18250 states to 18250 states and 57271 transitions. [2019-12-19 02:36:17,110 INFO L78 Accepts]: Start accepts. Automaton has 18250 states and 57271 transitions. Word has length 82 [2019-12-19 02:36:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:17,110 INFO L462 AbstractCegarLoop]: Abstraction has 18250 states and 57271 transitions. [2019-12-19 02:36:17,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:36:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 18250 states and 57271 transitions. [2019-12-19 02:36:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 02:36:17,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:17,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:17,126 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1257147240, now seen corresponding path program 1 times [2019-12-19 02:36:17,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:17,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257292694] [2019-12-19 02:36:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:17,170 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 02:36:17,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257292694] [2019-12-19 02:36:17,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:17,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:36:17,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902185839] [2019-12-19 02:36:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:36:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:36:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:36:17,172 INFO L87 Difference]: Start difference. First operand 18250 states and 57271 transitions. Second operand 3 states. [2019-12-19 02:36:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:17,405 INFO L93 Difference]: Finished difference Result 19581 states and 61170 transitions. [2019-12-19 02:36:17,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:36:17,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-19 02:36:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:17,435 INFO L225 Difference]: With dead ends: 19581 [2019-12-19 02:36:17,435 INFO L226 Difference]: Without dead ends: 19581 [2019-12-19 02:36:17,435 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 02:36:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19581 states. [2019-12-19 02:36:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19581 to 18922. [2019-12-19 02:36:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-19 02:36:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 59235 transitions. [2019-12-19 02:36:17,693 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 59235 transitions. Word has length 82 [2019-12-19 02:36:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:17,694 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 59235 transitions. [2019-12-19 02:36:17,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:36:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 59235 transitions. [2019-12-19 02:36:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:36:17,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:17,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:17,710 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash 966454904, now seen corresponding path program 1 times [2019-12-19 02:36:17,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:17,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971510218] [2019-12-19 02:36:17,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:17,815 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 02:36:17,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971510218] [2019-12-19 02:36:17,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:17,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:17,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073134262] [2019-12-19 02:36:17,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:17,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:17,817 INFO L87 Difference]: Start difference. First operand 18922 states and 59235 transitions. Second operand 6 states. [2019-12-19 02:36:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:18,847 INFO L93 Difference]: Finished difference Result 27781 states and 85391 transitions. [2019-12-19 02:36:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:36:18,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 02:36:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:18,890 INFO L225 Difference]: With dead ends: 27781 [2019-12-19 02:36:18,890 INFO L226 Difference]: Without dead ends: 27475 [2019-12-19 02:36:18,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:36:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27475 states. [2019-12-19 02:36:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27475 to 21952. [2019-12-19 02:36:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21952 states. [2019-12-19 02:36:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21952 states to 21952 states and 68575 transitions. [2019-12-19 02:36:19,217 INFO L78 Accepts]: Start accepts. Automaton has 21952 states and 68575 transitions. Word has length 83 [2019-12-19 02:36:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:19,217 INFO L462 AbstractCegarLoop]: Abstraction has 21952 states and 68575 transitions. [2019-12-19 02:36:19,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 21952 states and 68575 transitions. [2019-12-19 02:36:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:36:19,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:19,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:19,236 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1928068921, now seen corresponding path program 1 times [2019-12-19 02:36:19,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:19,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431653991] [2019-12-19 02:36:19,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:19,336 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 02:36:19,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431653991] [2019-12-19 02:36:19,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:19,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:36:19,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664256170] [2019-12-19 02:36:19,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:36:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:36:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:19,338 INFO L87 Difference]: Start difference. First operand 21952 states and 68575 transitions. Second operand 7 states. [2019-12-19 02:36:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:20,593 INFO L93 Difference]: Finished difference Result 39375 states and 118842 transitions. [2019-12-19 02:36:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:36:20,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-19 02:36:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:20,655 INFO L225 Difference]: With dead ends: 39375 [2019-12-19 02:36:20,655 INFO L226 Difference]: Without dead ends: 39303 [2019-12-19 02:36:20,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:36:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39303 states. [2019-12-19 02:36:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39303 to 23773. [2019-12-19 02:36:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23773 states. [2019-12-19 02:36:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23773 states to 23773 states and 73009 transitions. [2019-12-19 02:36:21,089 INFO L78 Accepts]: Start accepts. Automaton has 23773 states and 73009 transitions. Word has length 83 [2019-12-19 02:36:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:21,089 INFO L462 AbstractCegarLoop]: Abstraction has 23773 states and 73009 transitions. [2019-12-19 02:36:21,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:36:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 23773 states and 73009 transitions. [2019-12-19 02:36:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:36:21,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:21,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:21,113 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:21,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1122133894, now seen corresponding path program 1 times [2019-12-19 02:36:21,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:21,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405581893] [2019-12-19 02:36:21,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:21,267 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 02:36:21,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405581893] [2019-12-19 02:36:21,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:21,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:21,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728442448] [2019-12-19 02:36:21,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:21,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:21,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:21,271 INFO L87 Difference]: Start difference. First operand 23773 states and 73009 transitions. Second operand 6 states. [2019-12-19 02:36:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:21,523 INFO L93 Difference]: Finished difference Result 24821 states and 75816 transitions. [2019-12-19 02:36:21,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:36:21,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 02:36:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:21,559 INFO L225 Difference]: With dead ends: 24821 [2019-12-19 02:36:21,560 INFO L226 Difference]: Without dead ends: 24821 [2019-12-19 02:36:21,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2019-12-19 02:36:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 24471. [2019-12-19 02:36:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24471 states. [2019-12-19 02:36:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24471 states to 24471 states and 74914 transitions. [2019-12-19 02:36:22,036 INFO L78 Accepts]: Start accepts. Automaton has 24471 states and 74914 transitions. Word has length 83 [2019-12-19 02:36:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:22,036 INFO L462 AbstractCegarLoop]: Abstraction has 24471 states and 74914 transitions. [2019-12-19 02:36:22,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24471 states and 74914 transitions. [2019-12-19 02:36:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:36:22,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:22,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:22,061 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 43771321, now seen corresponding path program 1 times [2019-12-19 02:36:22,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:22,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957771780] [2019-12-19 02:36:22,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:36:22,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957771780] [2019-12-19 02:36:22,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:22,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:22,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685553154] [2019-12-19 02:36:22,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:22,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:22,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:22,179 INFO L87 Difference]: Start difference. First operand 24471 states and 74914 transitions. Second operand 6 states. [2019-12-19 02:36:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:22,913 INFO L93 Difference]: Finished difference Result 36681 states and 111434 transitions. [2019-12-19 02:36:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:36:22,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 02:36:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:22,967 INFO L225 Difference]: With dead ends: 36681 [2019-12-19 02:36:22,967 INFO L226 Difference]: Without dead ends: 36681 [2019-12-19 02:36:22,968 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 02:36:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36681 states. [2019-12-19 02:36:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36681 to 27102. [2019-12-19 02:36:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27102 states. [2019-12-19 02:36:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27102 states to 27102 states and 82608 transitions. [2019-12-19 02:36:23,391 INFO L78 Accepts]: Start accepts. Automaton has 27102 states and 82608 transitions. Word has length 83 [2019-12-19 02:36:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:23,391 INFO L462 AbstractCegarLoop]: Abstraction has 27102 states and 82608 transitions. [2019-12-19 02:36:23,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27102 states and 82608 transitions. [2019-12-19 02:36:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 02:36:23,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:23,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:23,414 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1288535802, now seen corresponding path program 1 times [2019-12-19 02:36:23,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:23,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961991941] [2019-12-19 02:36:23,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:23,469 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 02:36:23,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961991941] [2019-12-19 02:36:23,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:23,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:36:23,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085315011] [2019-12-19 02:36:23,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:36:23,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:23,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:36:23,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:36:23,471 INFO L87 Difference]: Start difference. First operand 27102 states and 82608 transitions. Second operand 3 states. [2019-12-19 02:36:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:23,587 INFO L93 Difference]: Finished difference Result 21606 states and 65510 transitions. [2019-12-19 02:36:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:36:23,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-19 02:36:23,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:23,617 INFO L225 Difference]: With dead ends: 21606 [2019-12-19 02:36:23,617 INFO L226 Difference]: Without dead ends: 21528 [2019-12-19 02:36:23,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:36:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21528 states. [2019-12-19 02:36:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21528 to 18848. [2019-12-19 02:36:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18848 states. [2019-12-19 02:36:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18848 states to 18848 states and 57623 transitions. [2019-12-19 02:36:24,104 INFO L78 Accepts]: Start accepts. Automaton has 18848 states and 57623 transitions. Word has length 83 [2019-12-19 02:36:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:24,104 INFO L462 AbstractCegarLoop]: Abstraction has 18848 states and 57623 transitions. [2019-12-19 02:36:24,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:36:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18848 states and 57623 transitions. [2019-12-19 02:36:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 02:36:24,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:24,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:24,121 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash -686793271, now seen corresponding path program 1 times [2019-12-19 02:36:24,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:24,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222250964] [2019-12-19 02:36:24,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:24,206 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 02:36:24,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222250964] [2019-12-19 02:36:24,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:24,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:24,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790537416] [2019-12-19 02:36:24,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:24,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:24,208 INFO L87 Difference]: Start difference. First operand 18848 states and 57623 transitions. Second operand 6 states. [2019-12-19 02:36:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:24,902 INFO L93 Difference]: Finished difference Result 31403 states and 94952 transitions. [2019-12-19 02:36:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:36:24,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-19 02:36:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:24,951 INFO L225 Difference]: With dead ends: 31403 [2019-12-19 02:36:24,951 INFO L226 Difference]: Without dead ends: 31283 [2019-12-19 02:36:24,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:36:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-12-19 02:36:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 24905. [2019-12-19 02:36:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24905 states. [2019-12-19 02:36:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24905 states to 24905 states and 76412 transitions. [2019-12-19 02:36:25,321 INFO L78 Accepts]: Start accepts. Automaton has 24905 states and 76412 transitions. Word has length 84 [2019-12-19 02:36:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:25,321 INFO L462 AbstractCegarLoop]: Abstraction has 24905 states and 76412 transitions. [2019-12-19 02:36:25,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24905 states and 76412 transitions. [2019-12-19 02:36:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 02:36:25,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:25,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:25,342 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 557971210, now seen corresponding path program 1 times [2019-12-19 02:36:25,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:25,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761189548] [2019-12-19 02:36:25,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:25,436 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 02:36:25,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761189548] [2019-12-19 02:36:25,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:25,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:36:25,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679872486] [2019-12-19 02:36:25,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:36:25,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:36:25,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:36:25,439 INFO L87 Difference]: Start difference. First operand 24905 states and 76412 transitions. Second operand 5 states. [2019-12-19 02:36:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:25,494 INFO L93 Difference]: Finished difference Result 3242 states and 8015 transitions. [2019-12-19 02:36:25,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:36:25,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 02:36:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:25,500 INFO L225 Difference]: With dead ends: 3242 [2019-12-19 02:36:25,501 INFO L226 Difference]: Without dead ends: 2861 [2019-12-19 02:36:25,501 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 02:36:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-12-19 02:36:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2635. [2019-12-19 02:36:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2019-12-19 02:36:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 6485 transitions. [2019-12-19 02:36:25,560 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 6485 transitions. Word has length 84 [2019-12-19 02:36:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:25,561 INFO L462 AbstractCegarLoop]: Abstraction has 2635 states and 6485 transitions. [2019-12-19 02:36:25,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:36:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 6485 transitions. [2019-12-19 02:36:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:25,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:25,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:25,567 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1708084537, now seen corresponding path program 1 times [2019-12-19 02:36:25,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:25,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583155892] [2019-12-19 02:36:25,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:25,741 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 02:36:25,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583155892] [2019-12-19 02:36:25,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:25,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970872670] [2019-12-19 02:36:25,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:25,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:25,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:25,745 INFO L87 Difference]: Start difference. First operand 2635 states and 6485 transitions. Second operand 6 states. [2019-12-19 02:36:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:25,892 INFO L93 Difference]: Finished difference Result 2560 states and 6303 transitions. [2019-12-19 02:36:25,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:36:25,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:36:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:25,898 INFO L225 Difference]: With dead ends: 2560 [2019-12-19 02:36:25,898 INFO L226 Difference]: Without dead ends: 2560 [2019-12-19 02:36:25,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-12-19 02:36:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2436. [2019-12-19 02:36:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2436 states. [2019-12-19 02:36:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 5998 transitions. [2019-12-19 02:36:25,951 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 5998 transitions. Word has length 97 [2019-12-19 02:36:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 2436 states and 5998 transitions. [2019-12-19 02:36:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 5998 transitions. [2019-12-19 02:36:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:25,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:25,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:25,957 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -948837094, now seen corresponding path program 1 times [2019-12-19 02:36:25,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:25,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255202856] [2019-12-19 02:36:25,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:26,147 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 02:36:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255202856] [2019-12-19 02:36:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624324809] [2019-12-19 02:36:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:26,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:26,149 INFO L87 Difference]: Start difference. First operand 2436 states and 5998 transitions. Second operand 6 states. [2019-12-19 02:36:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:26,291 INFO L93 Difference]: Finished difference Result 2626 states and 6327 transitions. [2019-12-19 02:36:26,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:36:26,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:36:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:26,297 INFO L225 Difference]: With dead ends: 2626 [2019-12-19 02:36:26,297 INFO L226 Difference]: Without dead ends: 2581 [2019-12-19 02:36:26,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2019-12-19 02:36:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2459. [2019-12-19 02:36:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-12-19 02:36:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 5991 transitions. [2019-12-19 02:36:26,352 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 5991 transitions. Word has length 97 [2019-12-19 02:36:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:26,352 INFO L462 AbstractCegarLoop]: Abstraction has 2459 states and 5991 transitions. [2019-12-19 02:36:26,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 5991 transitions. [2019-12-19 02:36:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:26,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:26,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:26,358 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1410469915, now seen corresponding path program 1 times [2019-12-19 02:36:26,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:26,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084707099] [2019-12-19 02:36:26,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:26,509 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 02:36:26,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084707099] [2019-12-19 02:36:26,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:26,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:36:26,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099634277] [2019-12-19 02:36:26,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:36:26,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:26,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:36:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:36:26,513 INFO L87 Difference]: Start difference. First operand 2459 states and 5991 transitions. Second operand 7 states. [2019-12-19 02:36:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:27,023 INFO L93 Difference]: Finished difference Result 4518 states and 11136 transitions. [2019-12-19 02:36:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:36:27,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 02:36:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:27,030 INFO L225 Difference]: With dead ends: 4518 [2019-12-19 02:36:27,031 INFO L226 Difference]: Without dead ends: 4518 [2019-12-19 02:36:27,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:36:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2019-12-19 02:36:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 2591. [2019-12-19 02:36:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2019-12-19 02:36:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 6264 transitions. [2019-12-19 02:36:27,089 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 6264 transitions. Word has length 97 [2019-12-19 02:36:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:27,089 INFO L462 AbstractCegarLoop]: Abstraction has 2591 states and 6264 transitions. [2019-12-19 02:36:27,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:36:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 6264 transitions. [2019-12-19 02:36:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:27,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:27,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:27,093 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1740235676, now seen corresponding path program 1 times [2019-12-19 02:36:27,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:27,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061622400] [2019-12-19 02:36:27,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:27,160 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 02:36:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061622400] [2019-12-19 02:36:27,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:27,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:36:27,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289493612] [2019-12-19 02:36:27,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:36:27,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:27,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:36:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:36:27,163 INFO L87 Difference]: Start difference. First operand 2591 states and 6264 transitions. Second operand 4 states. [2019-12-19 02:36:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:27,245 INFO L93 Difference]: Finished difference Result 2555 states and 6144 transitions. [2019-12-19 02:36:27,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:36:27,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 02:36:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:27,249 INFO L225 Difference]: With dead ends: 2555 [2019-12-19 02:36:27,249 INFO L226 Difference]: Without dead ends: 2555 [2019-12-19 02:36:27,250 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 02:36:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-12-19 02:36:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-12-19 02:36:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-12-19 02:36:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 6144 transitions. [2019-12-19 02:36:27,285 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 6144 transitions. Word has length 97 [2019-12-19 02:36:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:27,285 INFO L462 AbstractCegarLoop]: Abstraction has 2555 states and 6144 transitions. [2019-12-19 02:36:27,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:36:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 6144 transitions. [2019-12-19 02:36:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:27,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:27,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:27,289 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash -553018629, now seen corresponding path program 1 times [2019-12-19 02:36:27,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:27,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670578786] [2019-12-19 02:36:27,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:27,380 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 02:36:27,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670578786] [2019-12-19 02:36:27,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:27,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:36:27,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947808467] [2019-12-19 02:36:27,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:36:27,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:36:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:36:27,383 INFO L87 Difference]: Start difference. First operand 2555 states and 6144 transitions. Second operand 5 states. [2019-12-19 02:36:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:27,659 INFO L93 Difference]: Finished difference Result 2861 states and 6849 transitions. [2019-12-19 02:36:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:36:27,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 02:36:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:27,665 INFO L225 Difference]: With dead ends: 2861 [2019-12-19 02:36:27,665 INFO L226 Difference]: Without dead ends: 2843 [2019-12-19 02:36:27,666 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 02:36:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-19 02:36:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2582. [2019-12-19 02:36:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2019-12-19 02:36:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 6198 transitions. [2019-12-19 02:36:27,719 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 6198 transitions. Word has length 97 [2019-12-19 02:36:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:27,720 INFO L462 AbstractCegarLoop]: Abstraction has 2582 states and 6198 transitions. [2019-12-19 02:36:27,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:36:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 6198 transitions. [2019-12-19 02:36:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:27,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:27,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:36:27,725 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 691745852, now seen corresponding path program 1 times [2019-12-19 02:36:27,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:27,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66367903] [2019-12-19 02:36:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:27,824 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 02:36:27,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66367903] [2019-12-19 02:36:27,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:27,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:36:27,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759009364] [2019-12-19 02:36:27,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:36:27,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:36:27,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:36:27,826 INFO L87 Difference]: Start difference. First operand 2582 states and 6198 transitions. Second operand 5 states. [2019-12-19 02:36:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:27,872 INFO L93 Difference]: Finished difference Result 3439 states and 8363 transitions. [2019-12-19 02:36:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:36:27,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 02:36:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:27,878 INFO L225 Difference]: With dead ends: 3439 [2019-12-19 02:36:27,878 INFO L226 Difference]: Without dead ends: 3439 [2019-12-19 02:36:27,879 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 02:36:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2019-12-19 02:36:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2450. [2019-12-19 02:36:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2019-12-19 02:36:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5870 transitions. [2019-12-19 02:36:27,920 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5870 transitions. Word has length 97 [2019-12-19 02:36:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:27,920 INFO L462 AbstractCegarLoop]: Abstraction has 2450 states and 5870 transitions. [2019-12-19 02:36:27,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:36:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5870 transitions. [2019-12-19 02:36:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:27,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:27,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:27,924 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:27,924 INFO L82 PathProgramCache]: Analyzing trace with hash -821367206, now seen corresponding path program 1 times [2019-12-19 02:36:27,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:27,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956144930] [2019-12-19 02:36:27,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:28,069 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 02:36:28,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956144930] [2019-12-19 02:36:28,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:28,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:36:28,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027124683] [2019-12-19 02:36:28,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:36:28,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:36:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:36:28,071 INFO L87 Difference]: Start difference. First operand 2450 states and 5870 transitions. Second operand 6 states. [2019-12-19 02:36:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:28,266 INFO L93 Difference]: Finished difference Result 2703 states and 6326 transitions. [2019-12-19 02:36:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:36:28,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 02:36:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:28,271 INFO L225 Difference]: With dead ends: 2703 [2019-12-19 02:36:28,271 INFO L226 Difference]: Without dead ends: 2703 [2019-12-19 02:36:28,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:36:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-19 02:36:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2493. [2019-12-19 02:36:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-12-19 02:36:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 5926 transitions. [2019-12-19 02:36:28,313 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 5926 transitions. Word has length 97 [2019-12-19 02:36:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:28,313 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 5926 transitions. [2019-12-19 02:36:28,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:36:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 5926 transitions. [2019-12-19 02:36:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:28,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:28,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:28,316 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -491601445, now seen corresponding path program 1 times [2019-12-19 02:36:28,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:28,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671833420] [2019-12-19 02:36:28,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:36:28,459 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 02:36:28,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671833420] [2019-12-19 02:36:28,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:36:28,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:36:28,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636700427] [2019-12-19 02:36:28,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:36:28,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:36:28,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:36:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:36:28,461 INFO L87 Difference]: Start difference. First operand 2493 states and 5926 transitions. Second operand 8 states. [2019-12-19 02:36:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:36:28,660 INFO L93 Difference]: Finished difference Result 3839 states and 9160 transitions. [2019-12-19 02:36:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:36:28,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 02:36:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:36:28,664 INFO L225 Difference]: With dead ends: 3839 [2019-12-19 02:36:28,665 INFO L226 Difference]: Without dead ends: 1428 [2019-12-19 02:36:28,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:36:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-19 02:36:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-19 02:36:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-19 02:36:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-19 02:36:28,696 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-19 02:36:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:36:28,697 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-19 02:36:28,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:36:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-19 02:36:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 02:36:28,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:36:28,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:36:28,701 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:36:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:36:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 530847507, now seen corresponding path program 2 times [2019-12-19 02:36:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:36:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918677289] [2019-12-19 02:36:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:36:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:36:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:36:28,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:36:28,911 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:36:29,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:36:29 BasicIcfg [2019-12-19 02:36:29,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:36:29,158 INFO L168 Benchmark]: Toolchain (without parser) took 56258.72 ms. Allocated memory was 147.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 103.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 308.4 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,163 INFO L168 Benchmark]: CDTParser took 1.50 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.55 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.3 MB in the beginning and 158.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.50 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,165 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,168 INFO L168 Benchmark]: RCFGBuilder took 777.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 108.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,169 INFO L168 Benchmark]: TraceAbstraction took 54554.84 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:36:29,171 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.50 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.55 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.3 MB in the beginning and 158.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.50 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 108.9 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54554.84 ms. Allocated memory was 204.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 255.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L788] 0 pthread_t t1101; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 0 pthread_t t1102; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 2 x$w_buff1 = x$w_buff0 [L747] 2 x$w_buff0 = 2 [L748] 2 x$w_buff1_used = x$w_buff0_used [L749] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 0 x = x$flush_delayed ? x$mem_tmp : x [L817] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 54.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8470 SDtfs, 9200 SDslu, 18178 SDs, 0 SdLazy, 8251 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 85 SyntacticMatches, 18 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76080occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 121269 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 462178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...