/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/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:33:45,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:33:45,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:33:45,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:33:45,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:33:45,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:33:45,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:33:45,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:33:45,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:33:45,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:33:45,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:33:45,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:33:45,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:33:45,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:33:45,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:33:45,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:33:45,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:33:45,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:33:45,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:33:45,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:33:45,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:33:45,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:33:45,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:33:45,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:33:45,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:33:45,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:33:45,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:33:45,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:33:45,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:33:45,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:33:45,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:33:45,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:33:45,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:33:45,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:33:45,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:33:45,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:33:45,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:33:45,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:33:45,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:33:45,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:33:45,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:33:45,693 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 04:33:45,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:33:45,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:33:45,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:33:45,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:33:45,709 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:33:45,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:33:45,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:33:45,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:33:45,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:33:45,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:33:45,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:33:45,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:33:45,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:33:45,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:33:45,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:33:45,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:33:45,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:33:45,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:33:45,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:33:45,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:33:45,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:33:45,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:33:45,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:33:45,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:33:45,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:33:45,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:33:45,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:33:45,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:33:45,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:33:45,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:33:45,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:33:45,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:33:45,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:33:45,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:33:45,990 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:33:45,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-19 04:33:46,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7527839/3769fd2d5c1a495787f59476227a73e1/FLAG9afd90614 [2019-12-19 04:33:46,620 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:33:46,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-19 04:33:46,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7527839/3769fd2d5c1a495787f59476227a73e1/FLAG9afd90614 [2019-12-19 04:33:46,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7527839/3769fd2d5c1a495787f59476227a73e1 [2019-12-19 04:33:46,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:33:46,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:33:46,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:33:46,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:33:46,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:33:46,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:46" (1/1) ... [2019-12-19 04:33:46,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1edfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:46, skipping insertion in model container [2019-12-19 04:33:46,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:46" (1/1) ... [2019-12-19 04:33:46,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:33:47,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:33:47,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:33:47,542 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:33:47,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:33:47,714 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:33:47,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47 WrapperNode [2019-12-19 04:33:47,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:33:47,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:33:47,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:33:47,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:33:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:33:47,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:33:47,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:33:47,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:33:47,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (1/1) ... [2019-12-19 04:33:47,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:33:47,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:33:47,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:33:47,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:33:47,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (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 04:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:33:47,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:33:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:33:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:33:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:33:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:33:47,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:33:47,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:33:47,878 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 04:33:48,581 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:33:48,581 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:33:48,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:48 BoogieIcfgContainer [2019-12-19 04:33:48,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:33:48,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:33:48,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:33:48,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:33:48,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:33:46" (1/3) ... [2019-12-19 04:33:48,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c2d09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:48, skipping insertion in model container [2019-12-19 04:33:48,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:47" (2/3) ... [2019-12-19 04:33:48,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c2d09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:48, skipping insertion in model container [2019-12-19 04:33:48,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:48" (3/3) ... [2019-12-19 04:33:48,591 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-19 04:33:48,602 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:33:48,602 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:33:48,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:33:48,611 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:33:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,674 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,674 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:48,691 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:33:48,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:33:48,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:33:48,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:33:48,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:33:48,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:33:48,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:33:48,711 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:33:48,711 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:33:48,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 04:33:49,986 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-19 04:33:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-19 04:33:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 04:33:49,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:49,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:50,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-19 04:33:50,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:50,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440984052] [2019-12-19 04:33:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:50,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440984052] [2019-12-19 04:33:50,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:50,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:50,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181473546] [2019-12-19 04:33:50,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:50,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:50,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:50,343 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-19 04:33:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:50,952 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-19 04:33:50,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:33:50,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 04:33:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:51,225 INFO L225 Difference]: With dead ends: 23454 [2019-12-19 04:33:51,226 INFO L226 Difference]: Without dead ends: 21278 [2019-12-19 04:33:51,229 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 04:33:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-19 04:33:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-19 04:33:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-19 04:33:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-19 04:33:53,214 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-19 04:33:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:53,215 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-19 04:33:53,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-19 04:33:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 04:33:53,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:53,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:53,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:53,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-19 04:33:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:53,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957717892] [2019-12-19 04:33:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:53,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957717892] [2019-12-19 04:33:53,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:53,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:53,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906629653] [2019-12-19 04:33:53,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:53,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:53,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:53,358 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-19 04:33:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:55,496 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-19 04:33:55,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:55,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 04:33:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:55,656 INFO L225 Difference]: With dead ends: 34712 [2019-12-19 04:33:55,656 INFO L226 Difference]: Without dead ends: 34568 [2019-12-19 04:33:55,657 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 04:33:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-19 04:33:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-19 04:33:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-19 04:33:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-19 04:33:56,830 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-19 04:33:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:56,832 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-19 04:33:56,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-19 04:33:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 04:33:56,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:56,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:56,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-19 04:33:56,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:56,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260764476] [2019-12-19 04:33:56,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:56,928 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 04:33:56,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260764476] [2019-12-19 04:33:56,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:56,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:56,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679183034] [2019-12-19 04:33:56,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:56,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:56,930 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-19 04:33:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:57,740 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-19 04:33:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:57,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 04:33:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:57,982 INFO L225 Difference]: With dead ends: 40220 [2019-12-19 04:33:57,982 INFO L226 Difference]: Without dead ends: 40060 [2019-12-19 04:33:57,983 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 04:33:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-19 04:34:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-19 04:34:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-19 04:34:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-19 04:34:00,571 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-19 04:34:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:00,572 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-19 04:34:00,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-19 04:34:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 04:34:00,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:00,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:00,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-19 04:34:00,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:00,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441361597] [2019-12-19 04:34:00,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:00,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441361597] [2019-12-19 04:34:00,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:00,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:00,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421924549] [2019-12-19 04:34:00,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:00,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:00,733 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-19 04:34:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:01,925 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-19 04:34:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:34:01,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 04:34:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:02,031 INFO L225 Difference]: With dead ends: 45669 [2019-12-19 04:34:02,031 INFO L226 Difference]: Without dead ends: 45525 [2019-12-19 04:34:02,032 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 04:34:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-19 04:34:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-19 04:34:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-19 04:34:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-19 04:34:04,352 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-19 04:34:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:04,353 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-19 04:34:04,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-19 04:34:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 04:34:04,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:04,388 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] [2019-12-19 04:34:04,389 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-19 04:34:04,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:04,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913119003] [2019-12-19 04:34:04,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:04,485 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 04:34:04,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913119003] [2019-12-19 04:34:04,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:04,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:04,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135772997] [2019-12-19 04:34:04,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:04,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:04,487 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-19 04:34:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:05,138 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-19 04:34:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:34:05,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 04:34:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:05,630 INFO L225 Difference]: With dead ends: 46076 [2019-12-19 04:34:05,631 INFO L226 Difference]: Without dead ends: 45836 [2019-12-19 04:34:05,631 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 04:34:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-19 04:34:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-19 04:34:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-19 04:34:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-19 04:34:08,685 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-19 04:34:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:08,685 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-19 04:34:08,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-19 04:34:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 04:34:08,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:08,716 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 04:34:08,716 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-19 04:34:08,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:08,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268423106] [2019-12-19 04:34:08,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:08,785 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 04:34:08,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268423106] [2019-12-19 04:34:08,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:08,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:08,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749372035] [2019-12-19 04:34:08,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:08,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:08,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:08,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:08,788 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-19 04:34:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:09,050 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-19 04:34:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:09,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 04:34:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:09,161 INFO L225 Difference]: With dead ends: 50263 [2019-12-19 04:34:09,162 INFO L226 Difference]: Without dead ends: 50263 [2019-12-19 04:34:09,162 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 04:34:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-19 04:34:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-19 04:34:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-19 04:34:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-19 04:34:10,275 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-19 04:34:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:10,276 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-19 04:34:10,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-19 04:34:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:34:10,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:10,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:10,311 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-19 04:34:10,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:10,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879927800] [2019-12-19 04:34:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:10,412 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 04:34:10,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879927800] [2019-12-19 04:34:10,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:10,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:10,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93330927] [2019-12-19 04:34:10,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:10,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:10,414 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-19 04:34:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:11,388 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-19 04:34:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:34:11,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 04:34:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:11,499 INFO L225 Difference]: With dead ends: 55891 [2019-12-19 04:34:11,500 INFO L226 Difference]: Without dead ends: 55651 [2019-12-19 04:34:11,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:34:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-19 04:34:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-19 04:34:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-19 04:34:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-19 04:34:12,816 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-19 04:34:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:12,816 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-19 04:34:12,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-19 04:34:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:34:12,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:12,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:12,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-19 04:34:12,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:12,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116140967] [2019-12-19 04:34:12,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:12,923 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 04:34:12,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116140967] [2019-12-19 04:34:12,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:12,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:12,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567706153] [2019-12-19 04:34:12,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:12,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:12,926 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-19 04:34:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:13,698 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-19 04:34:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:13,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 04:34:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:13,853 INFO L225 Difference]: With dead ends: 69403 [2019-12-19 04:34:13,854 INFO L226 Difference]: Without dead ends: 69403 [2019-12-19 04:34:13,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-19 04:34:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-19 04:34:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-19 04:34:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-19 04:34:15,412 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-19 04:34:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:15,412 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-19 04:34:15,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-19 04:34:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:34:15,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:15,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:15,454 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-19 04:34:15,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:15,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193801671] [2019-12-19 04:34:15,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:15,543 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 04:34:15,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193801671] [2019-12-19 04:34:15,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:15,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:15,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676527904] [2019-12-19 04:34:15,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:15,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:15,546 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-19 04:34:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:16,836 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-19 04:34:16,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:34:16,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 04:34:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:16,962 INFO L225 Difference]: With dead ends: 63822 [2019-12-19 04:34:16,962 INFO L226 Difference]: Without dead ends: 63622 [2019-12-19 04:34:16,963 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 04:34:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-19 04:34:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-19 04:34:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-19 04:34:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-19 04:34:18,392 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-19 04:34:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:18,392 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-19 04:34:18,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-19 04:34:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:18,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:18,448 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 04:34:18,448 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-19 04:34:18,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:18,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860404227] [2019-12-19 04:34:18,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:18,572 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 04:34:18,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860404227] [2019-12-19 04:34:18,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:18,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:18,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012478487] [2019-12-19 04:34:18,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:18,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:18,574 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-19 04:34:19,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:19,733 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-19 04:34:19,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:19,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 04:34:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:19,913 INFO L225 Difference]: With dead ends: 75817 [2019-12-19 04:34:19,913 INFO L226 Difference]: Without dead ends: 75173 [2019-12-19 04:34:19,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-19 04:34:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-19 04:34:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-19 04:34:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-19 04:34:23,912 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-19 04:34:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:23,913 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-19 04:34:23,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-19 04:34:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:23,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:23,978 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 04:34:23,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-19 04:34:23,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:23,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615895653] [2019-12-19 04:34:23,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:24,100 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 04:34:24,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615895653] [2019-12-19 04:34:24,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:24,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:24,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892951823] [2019-12-19 04:34:24,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:24,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:24,102 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-19 04:34:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:25,182 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-19 04:34:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:34:25,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 04:34:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:25,387 INFO L225 Difference]: With dead ends: 92241 [2019-12-19 04:34:25,387 INFO L226 Difference]: Without dead ends: 92241 [2019-12-19 04:34:25,388 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 04:34:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-19 04:34:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-19 04:34:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-19 04:34:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-19 04:34:27,445 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-19 04:34:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:27,445 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-19 04:34:27,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-19 04:34:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:34:27,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:27,521 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 04:34:27,522 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:27,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:27,522 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-19 04:34:27,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:27,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521675588] [2019-12-19 04:34:27,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:27,595 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 04:34:27,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521675588] [2019-12-19 04:34:27,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:27,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:27,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448941521] [2019-12-19 04:34:27,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:27,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:27,597 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 4 states. [2019-12-19 04:34:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:27,684 INFO L93 Difference]: Finished difference Result 19361 states and 61140 transitions. [2019-12-19 04:34:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:27,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 04:34:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:27,713 INFO L225 Difference]: With dead ends: 19361 [2019-12-19 04:34:27,713 INFO L226 Difference]: Without dead ends: 18883 [2019-12-19 04:34:27,713 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 04:34:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2019-12-19 04:34:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18871. [2019-12-19 04:34:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18871 states. [2019-12-19 04:34:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 59635 transitions. [2019-12-19 04:34:28,553 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 59635 transitions. Word has length 68 [2019-12-19 04:34:28,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:28,553 INFO L462 AbstractCegarLoop]: Abstraction has 18871 states and 59635 transitions. [2019-12-19 04:34:28,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:28,553 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 59635 transitions. [2019-12-19 04:34:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:28,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:28,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:28,569 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-19 04:34:28,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:28,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314555430] [2019-12-19 04:34:28,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:28,638 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 04:34:28,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314555430] [2019-12-19 04:34:28,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:28,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:28,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117200450] [2019-12-19 04:34:28,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:28,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:28,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:28,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:28,640 INFO L87 Difference]: Start difference. First operand 18871 states and 59635 transitions. Second operand 4 states. [2019-12-19 04:34:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:28,940 INFO L93 Difference]: Finished difference Result 24271 states and 75815 transitions. [2019-12-19 04:34:28,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:28,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 04:34:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:28,996 INFO L225 Difference]: With dead ends: 24271 [2019-12-19 04:34:28,997 INFO L226 Difference]: Without dead ends: 24271 [2019-12-19 04:34:28,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 04:34:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-12-19 04:34:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 19783. [2019-12-19 04:34:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19783 states. [2019-12-19 04:34:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 62293 transitions. [2019-12-19 04:34:29,322 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 62293 transitions. Word has length 78 [2019-12-19 04:34:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:29,323 INFO L462 AbstractCegarLoop]: Abstraction has 19783 states and 62293 transitions. [2019-12-19 04:34:29,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 62293 transitions. [2019-12-19 04:34:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:29,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:29,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:29,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:29,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:29,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-19 04:34:29,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:29,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058724386] [2019-12-19 04:34:29,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:29,447 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 04:34:29,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058724386] [2019-12-19 04:34:29,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:29,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:34:29,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552790026] [2019-12-19 04:34:29,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:34:29,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:34:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:29,449 INFO L87 Difference]: Start difference. First operand 19783 states and 62293 transitions. Second operand 8 states. [2019-12-19 04:34:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:30,608 INFO L93 Difference]: Finished difference Result 21937 states and 68541 transitions. [2019-12-19 04:34:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 04:34:30,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 04:34:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:30,642 INFO L225 Difference]: With dead ends: 21937 [2019-12-19 04:34:30,642 INFO L226 Difference]: Without dead ends: 21889 [2019-12-19 04:34:30,643 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 04:34:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21889 states. [2019-12-19 04:34:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21889 to 17452. [2019-12-19 04:34:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17452 states. [2019-12-19 04:34:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17452 states to 17452 states and 55312 transitions. [2019-12-19 04:34:30,907 INFO L78 Accepts]: Start accepts. Automaton has 17452 states and 55312 transitions. Word has length 78 [2019-12-19 04:34:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:30,907 INFO L462 AbstractCegarLoop]: Abstraction has 17452 states and 55312 transitions. [2019-12-19 04:34:30,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:34:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17452 states and 55312 transitions. [2019-12-19 04:34:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 04:34:30,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:30,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:30,923 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-19 04:34:30,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:30,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876292440] [2019-12-19 04:34:30,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:30,975 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 04:34:30,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876292440] [2019-12-19 04:34:30,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:30,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:30,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449965967] [2019-12-19 04:34:30,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:30,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:30,977 INFO L87 Difference]: Start difference. First operand 17452 states and 55312 transitions. Second operand 3 states. [2019-12-19 04:34:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:31,311 INFO L93 Difference]: Finished difference Result 18716 states and 59025 transitions. [2019-12-19 04:34:31,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:31,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 04:34:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:31,342 INFO L225 Difference]: With dead ends: 18716 [2019-12-19 04:34:31,342 INFO L226 Difference]: Without dead ends: 18716 [2019-12-19 04:34:31,342 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 04:34:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2019-12-19 04:34:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 18068. [2019-12-19 04:34:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-19 04:34:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 57126 transitions. [2019-12-19 04:34:31,607 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 57126 transitions. Word has length 79 [2019-12-19 04:34:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:31,607 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 57126 transitions. [2019-12-19 04:34:31,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 57126 transitions. [2019-12-19 04:34:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:34:31,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:31,626 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 04:34:31,626 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-19 04:34:31,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:31,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183470806] [2019-12-19 04:34:31,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:31,675 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 04:34:31,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183470806] [2019-12-19 04:34:31,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:31,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:31,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442312994] [2019-12-19 04:34:31,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:31,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:31,677 INFO L87 Difference]: Start difference. First operand 18068 states and 57126 transitions. Second operand 4 states. [2019-12-19 04:34:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:32,014 INFO L93 Difference]: Finished difference Result 21236 states and 66256 transitions. [2019-12-19 04:34:32,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:34:32,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 04:34:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:32,046 INFO L225 Difference]: With dead ends: 21236 [2019-12-19 04:34:32,046 INFO L226 Difference]: Without dead ends: 21236 [2019-12-19 04:34:32,046 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 04:34:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-19 04:34:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20213. [2019-12-19 04:34:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-19 04:34:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 63372 transitions. [2019-12-19 04:34:32,316 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 63372 transitions. Word has length 80 [2019-12-19 04:34:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:32,317 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 63372 transitions. [2019-12-19 04:34:32,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 63372 transitions. [2019-12-19 04:34:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:34:32,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:32,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:32,335 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-19 04:34:32,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:32,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711249954] [2019-12-19 04:34:32,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:32,386 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 04:34:32,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711249954] [2019-12-19 04:34:32,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:32,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:34:32,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323523232] [2019-12-19 04:34:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:34:32,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:32,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:34:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:34:32,389 INFO L87 Difference]: Start difference. First operand 20213 states and 63372 transitions. Second operand 3 states. [2019-12-19 04:34:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:32,644 INFO L93 Difference]: Finished difference Result 21556 states and 67295 transitions. [2019-12-19 04:34:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:34:32,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 04:34:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:32,675 INFO L225 Difference]: With dead ends: 21556 [2019-12-19 04:34:32,676 INFO L226 Difference]: Without dead ends: 21556 [2019-12-19 04:34:32,676 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 04:34:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2019-12-19 04:34:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 20893. [2019-12-19 04:34:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20893 states. [2019-12-19 04:34:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20893 states to 20893 states and 65352 transitions. [2019-12-19 04:34:32,946 INFO L78 Accepts]: Start accepts. Automaton has 20893 states and 65352 transitions. Word has length 80 [2019-12-19 04:34:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:32,946 INFO L462 AbstractCegarLoop]: Abstraction has 20893 states and 65352 transitions. [2019-12-19 04:34:32,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:34:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 20893 states and 65352 transitions. [2019-12-19 04:34:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:32,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:32,965 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 04:34:32,965 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-19 04:34:32,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:32,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913588676] [2019-12-19 04:34:32,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:33,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913588676] [2019-12-19 04:34:33,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:33,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:33,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123693869] [2019-12-19 04:34:33,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:33,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:33,067 INFO L87 Difference]: Start difference. First operand 20893 states and 65352 transitions. Second operand 6 states. [2019-12-19 04:34:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:33,903 INFO L93 Difference]: Finished difference Result 29926 states and 92023 transitions. [2019-12-19 04:34:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:34:33,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:33,965 INFO L225 Difference]: With dead ends: 29926 [2019-12-19 04:34:33,966 INFO L226 Difference]: Without dead ends: 29620 [2019-12-19 04:34:33,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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 04:34:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2019-12-19 04:34:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 23908. [2019-12-19 04:34:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23908 states. [2019-12-19 04:34:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23908 states to 23908 states and 74649 transitions. [2019-12-19 04:34:34,506 INFO L78 Accepts]: Start accepts. Automaton has 23908 states and 74649 transitions. Word has length 81 [2019-12-19 04:34:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:34,506 INFO L462 AbstractCegarLoop]: Abstraction has 23908 states and 74649 transitions. [2019-12-19 04:34:34,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23908 states and 74649 transitions. [2019-12-19 04:34:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:34,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:34,528 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 04:34:34,528 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:34,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-19 04:34:34,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:34,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903925120] [2019-12-19 04:34:34,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:34,624 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 04:34:34,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903925120] [2019-12-19 04:34:34,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:34,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:34,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697588322] [2019-12-19 04:34:34,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:34,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:34,626 INFO L87 Difference]: Start difference. First operand 23908 states and 74649 transitions. Second operand 7 states. [2019-12-19 04:34:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:35,891 INFO L93 Difference]: Finished difference Result 41338 states and 124799 transitions. [2019-12-19 04:34:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:34:35,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:34:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:35,952 INFO L225 Difference]: With dead ends: 41338 [2019-12-19 04:34:35,952 INFO L226 Difference]: Without dead ends: 41266 [2019-12-19 04:34:35,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 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 04:34:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41266 states. [2019-12-19 04:34:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41266 to 25666. [2019-12-19 04:34:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2019-12-19 04:34:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 78735 transitions. [2019-12-19 04:34:36,393 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 78735 transitions. Word has length 81 [2019-12-19 04:34:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:36,393 INFO L462 AbstractCegarLoop]: Abstraction has 25666 states and 78735 transitions. [2019-12-19 04:34:36,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 78735 transitions. [2019-12-19 04:34:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:36,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:36,416 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-19 04:34:36,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:36,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758064334] [2019-12-19 04:34:36,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:36,527 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 04:34:36,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758064334] [2019-12-19 04:34:36,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:36,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:36,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805768780] [2019-12-19 04:34:36,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:36,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:36,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:36,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:36,529 INFO L87 Difference]: Start difference. First operand 25666 states and 78735 transitions. Second operand 6 states. [2019-12-19 04:34:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:36,917 INFO L93 Difference]: Finished difference Result 39156 states and 120109 transitions. [2019-12-19 04:34:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:36,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:36,974 INFO L225 Difference]: With dead ends: 39156 [2019-12-19 04:34:36,974 INFO L226 Difference]: Without dead ends: 39156 [2019-12-19 04:34:36,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39156 states. [2019-12-19 04:34:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39156 to 25377. [2019-12-19 04:34:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25377 states. [2019-12-19 04:34:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25377 states to 25377 states and 77387 transitions. [2019-12-19 04:34:37,570 INFO L78 Accepts]: Start accepts. Automaton has 25377 states and 77387 transitions. Word has length 81 [2019-12-19 04:34:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:37,570 INFO L462 AbstractCegarLoop]: Abstraction has 25377 states and 77387 transitions. [2019-12-19 04:34:37,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25377 states and 77387 transitions. [2019-12-19 04:34:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:37,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:37,592 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 04:34:37,592 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -991140637, now seen corresponding path program 1 times [2019-12-19 04:34:37,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:37,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68214103] [2019-12-19 04:34:37,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:37,707 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 04:34:37,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68214103] [2019-12-19 04:34:37,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:37,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:37,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596269243] [2019-12-19 04:34:37,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:37,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:37,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:37,711 INFO L87 Difference]: Start difference. First operand 25377 states and 77387 transitions. Second operand 7 states. [2019-12-19 04:34:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:38,588 INFO L93 Difference]: Finished difference Result 31557 states and 94596 transitions. [2019-12-19 04:34:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:34:38,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:34:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:38,635 INFO L225 Difference]: With dead ends: 31557 [2019-12-19 04:34:38,635 INFO L226 Difference]: Without dead ends: 31557 [2019-12-19 04:34:38,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:34:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31557 states. [2019-12-19 04:34:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31557 to 27312. [2019-12-19 04:34:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27312 states. [2019-12-19 04:34:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27312 states to 27312 states and 83150 transitions. [2019-12-19 04:34:39,031 INFO L78 Accepts]: Start accepts. Automaton has 27312 states and 83150 transitions. Word has length 81 [2019-12-19 04:34:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:39,031 INFO L462 AbstractCegarLoop]: Abstraction has 27312 states and 83150 transitions. [2019-12-19 04:34:39,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27312 states and 83150 transitions. [2019-12-19 04:34:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:39,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:39,056 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 04:34:39,056 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 253623844, now seen corresponding path program 1 times [2019-12-19 04:34:39,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:39,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068306220] [2019-12-19 04:34:39,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:39,178 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 04:34:39,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068306220] [2019-12-19 04:34:39,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:39,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:39,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394810408] [2019-12-19 04:34:39,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:39,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:39,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:39,181 INFO L87 Difference]: Start difference. First operand 27312 states and 83150 transitions. Second operand 6 states. [2019-12-19 04:34:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:39,432 INFO L93 Difference]: Finished difference Result 27250 states and 82976 transitions. [2019-12-19 04:34:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:39,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:39,488 INFO L225 Difference]: With dead ends: 27250 [2019-12-19 04:34:39,488 INFO L226 Difference]: Without dead ends: 27250 [2019-12-19 04:34:39,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-19 04:34:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 27250. [2019-12-19 04:34:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27250 states. [2019-12-19 04:34:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27250 states to 27250 states and 82976 transitions. [2019-12-19 04:34:39,841 INFO L78 Accepts]: Start accepts. Automaton has 27250 states and 82976 transitions. Word has length 81 [2019-12-19 04:34:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:39,841 INFO L462 AbstractCegarLoop]: Abstraction has 27250 states and 82976 transitions. [2019-12-19 04:34:39,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27250 states and 82976 transitions. [2019-12-19 04:34:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:39,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:39,863 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 04:34:39,863 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:39,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -305951838, now seen corresponding path program 1 times [2019-12-19 04:34:39,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:39,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905254885] [2019-12-19 04:34:39,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:39,961 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 04:34:39,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905254885] [2019-12-19 04:34:39,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:39,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:39,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275209606] [2019-12-19 04:34:39,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:39,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:39,963 INFO L87 Difference]: Start difference. First operand 27250 states and 82976 transitions. Second operand 6 states. [2019-12-19 04:34:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:40,899 INFO L93 Difference]: Finished difference Result 40321 states and 121816 transitions. [2019-12-19 04:34:40,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:40,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:41,208 INFO L225 Difference]: With dead ends: 40321 [2019-12-19 04:34:41,208 INFO L226 Difference]: Without dead ends: 40321 [2019-12-19 04:34:41,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:34:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40321 states. [2019-12-19 04:34:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40321 to 28828. [2019-12-19 04:34:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28828 states. [2019-12-19 04:34:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28828 states to 28828 states and 87715 transitions. [2019-12-19 04:34:41,803 INFO L78 Accepts]: Start accepts. Automaton has 28828 states and 87715 transitions. Word has length 81 [2019-12-19 04:34:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:41,803 INFO L462 AbstractCegarLoop]: Abstraction has 28828 states and 87715 transitions. [2019-12-19 04:34:41,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28828 states and 87715 transitions. [2019-12-19 04:34:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:41,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:41,831 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash 938812643, now seen corresponding path program 1 times [2019-12-19 04:34:41,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:41,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264319281] [2019-12-19 04:34:41,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:41,966 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 04:34:41,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264319281] [2019-12-19 04:34:41,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:41,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:41,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135104538] [2019-12-19 04:34:41,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:41,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:41,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:41,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:41,969 INFO L87 Difference]: Start difference. First operand 28828 states and 87715 transitions. Second operand 5 states. [2019-12-19 04:34:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:42,201 INFO L93 Difference]: Finished difference Result 28747 states and 87427 transitions. [2019-12-19 04:34:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:42,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:34:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:42,242 INFO L225 Difference]: With dead ends: 28747 [2019-12-19 04:34:42,242 INFO L226 Difference]: Without dead ends: 28747 [2019-12-19 04:34:42,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28747 states. [2019-12-19 04:34:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28747 to 28702. [2019-12-19 04:34:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28702 states. [2019-12-19 04:34:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28702 states to 28702 states and 87307 transitions. [2019-12-19 04:34:42,610 INFO L78 Accepts]: Start accepts. Automaton has 28702 states and 87307 transitions. Word has length 81 [2019-12-19 04:34:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:42,610 INFO L462 AbstractCegarLoop]: Abstraction has 28702 states and 87307 transitions. [2019-12-19 04:34:42,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28702 states and 87307 transitions. [2019-12-19 04:34:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:42,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:42,634 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 04:34:42,634 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1900426660, now seen corresponding path program 1 times [2019-12-19 04:34:42,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:42,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549001751] [2019-12-19 04:34:42,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:42,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 04:34:42,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549001751] [2019-12-19 04:34:42,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:42,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:42,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192106635] [2019-12-19 04:34:42,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:42,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:42,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:42,742 INFO L87 Difference]: Start difference. First operand 28702 states and 87307 transitions. Second operand 5 states. [2019-12-19 04:34:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:42,891 INFO L93 Difference]: Finished difference Result 40057 states and 121690 transitions. [2019-12-19 04:34:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:42,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:34:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:42,949 INFO L225 Difference]: With dead ends: 40057 [2019-12-19 04:34:42,949 INFO L226 Difference]: Without dead ends: 40057 [2019-12-19 04:34:42,949 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 04:34:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-19 04:34:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 25282. [2019-12-19 04:34:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-12-19 04:34:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 75960 transitions. [2019-12-19 04:34:43,365 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 75960 transitions. Word has length 81 [2019-12-19 04:34:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:43,366 INFO L462 AbstractCegarLoop]: Abstraction has 25282 states and 75960 transitions. [2019-12-19 04:34:43,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 75960 transitions. [2019-12-19 04:34:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:43,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:43,387 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 04:34:43,387 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1913824220, now seen corresponding path program 1 times [2019-12-19 04:34:43,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:43,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424709005] [2019-12-19 04:34:43,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:43,470 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 04:34:43,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424709005] [2019-12-19 04:34:43,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:43,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:43,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518524087] [2019-12-19 04:34:43,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:43,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:43,472 INFO L87 Difference]: Start difference. First operand 25282 states and 75960 transitions. Second operand 5 states. [2019-12-19 04:34:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:43,529 INFO L93 Difference]: Finished difference Result 3064 states and 7430 transitions. [2019-12-19 04:34:43,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:34:43,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:34:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:43,533 INFO L225 Difference]: With dead ends: 3064 [2019-12-19 04:34:43,534 INFO L226 Difference]: Without dead ends: 2668 [2019-12-19 04:34:43,534 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 04:34:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-12-19 04:34:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2424. [2019-12-19 04:34:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-12-19 04:34:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 5875 transitions. [2019-12-19 04:34:43,581 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 5875 transitions. Word has length 81 [2019-12-19 04:34:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:43,582 INFO L462 AbstractCegarLoop]: Abstraction has 2424 states and 5875 transitions. [2019-12-19 04:34:43,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 5875 transitions. [2019-12-19 04:34:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:43,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:43,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:43,587 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1212257335, now seen corresponding path program 1 times [2019-12-19 04:34:43,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:43,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275495903] [2019-12-19 04:34:43,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:43,771 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-19 04:34:43,852 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 04:34:43,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275495903] [2019-12-19 04:34:43,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:43,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:43,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037242916] [2019-12-19 04:34:43,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:43,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:43,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:43,854 INFO L87 Difference]: Start difference. First operand 2424 states and 5875 transitions. Second operand 6 states. [2019-12-19 04:34:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:43,943 INFO L93 Difference]: Finished difference Result 2655 states and 6264 transitions. [2019-12-19 04:34:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:43,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:43,948 INFO L225 Difference]: With dead ends: 2655 [2019-12-19 04:34:43,948 INFO L226 Difference]: Without dead ends: 2610 [2019-12-19 04:34:43,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-19 04:34:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2463. [2019-12-19 04:34:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 04:34:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5897 transitions. [2019-12-19 04:34:43,983 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5897 transitions. Word has length 93 [2019-12-19 04:34:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:43,983 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5897 transitions. [2019-12-19 04:34:43,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5897 transitions. [2019-12-19 04:34:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:43,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:43,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:43,987 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -419839496, now seen corresponding path program 1 times [2019-12-19 04:34:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:43,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988836883] [2019-12-19 04:34:43,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:44,052 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 04:34:44,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988836883] [2019-12-19 04:34:44,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:44,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:44,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088734977] [2019-12-19 04:34:44,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:44,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:44,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:44,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:44,054 INFO L87 Difference]: Start difference. First operand 2463 states and 5897 transitions. Second operand 5 states. [2019-12-19 04:34:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:44,265 INFO L93 Difference]: Finished difference Result 2771 states and 6550 transitions. [2019-12-19 04:34:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:44,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:34:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:44,269 INFO L225 Difference]: With dead ends: 2771 [2019-12-19 04:34:44,269 INFO L226 Difference]: Without dead ends: 2753 [2019-12-19 04:34:44,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 04:34:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-12-19 04:34:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2534. [2019-12-19 04:34:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-19 04:34:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6039 transitions. [2019-12-19 04:34:44,310 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6039 transitions. Word has length 93 [2019-12-19 04:34:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:44,311 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6039 transitions. [2019-12-19 04:34:44,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6039 transitions. [2019-12-19 04:34:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:44,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:44,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:44,314 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2092638256, now seen corresponding path program 2 times [2019-12-19 04:34:44,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:44,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164811938] [2019-12-19 04:34:44,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:44,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164811938] [2019-12-19 04:34:44,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:44,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:44,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094375431] [2019-12-19 04:34:44,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:44,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:44,419 INFO L87 Difference]: Start difference. First operand 2534 states and 6039 transitions. Second operand 6 states. [2019-12-19 04:34:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:44,652 INFO L93 Difference]: Finished difference Result 3366 states and 7918 transitions. [2019-12-19 04:34:44,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:44,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:44,657 INFO L225 Difference]: With dead ends: 3366 [2019-12-19 04:34:44,658 INFO L226 Difference]: Without dead ends: 3330 [2019-12-19 04:34:44,658 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 04:34:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2019-12-19 04:34:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2810. [2019-12-19 04:34:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-19 04:34:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6664 transitions. [2019-12-19 04:34:44,686 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6664 transitions. Word has length 93 [2019-12-19 04:34:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:44,687 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6664 transitions. [2019-12-19 04:34:44,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6664 transitions. [2019-12-19 04:34:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:44,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:44,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:44,689 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:44,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1809487792, now seen corresponding path program 1 times [2019-12-19 04:34:44,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:44,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249436480] [2019-12-19 04:34:44,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:44,775 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 04:34:44,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249436480] [2019-12-19 04:34:44,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:44,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:44,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622692027] [2019-12-19 04:34:44,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:44,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:44,777 INFO L87 Difference]: Start difference. First operand 2810 states and 6664 transitions. Second operand 7 states. [2019-12-19 04:34:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:45,206 INFO L93 Difference]: Finished difference Result 5429 states and 13161 transitions. [2019-12-19 04:34:45,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:34:45,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-19 04:34:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:45,217 INFO L225 Difference]: With dead ends: 5429 [2019-12-19 04:34:45,217 INFO L226 Difference]: Without dead ends: 5429 [2019-12-19 04:34:45,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:34:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5429 states. [2019-12-19 04:34:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5429 to 2937. [2019-12-19 04:34:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-12-19 04:34:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 6972 transitions. [2019-12-19 04:34:45,296 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 6972 transitions. Word has length 93 [2019-12-19 04:34:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:45,297 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 6972 transitions. [2019-12-19 04:34:45,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 6972 transitions. [2019-12-19 04:34:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:45,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:45,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:45,303 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-19 04:34:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:45,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42151280] [2019-12-19 04:34:45,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:45,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42151280] [2019-12-19 04:34:45,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:45,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:45,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464882719] [2019-12-19 04:34:45,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:45,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:45,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:45,415 INFO L87 Difference]: Start difference. First operand 2937 states and 6972 transitions. Second operand 6 states. [2019-12-19 04:34:45,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:45,476 INFO L93 Difference]: Finished difference Result 4592 states and 11122 transitions. [2019-12-19 04:34:45,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:34:45,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:45,483 INFO L225 Difference]: With dead ends: 4592 [2019-12-19 04:34:45,484 INFO L226 Difference]: Without dead ends: 4592 [2019-12-19 04:34:45,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2019-12-19 04:34:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2900. [2019-12-19 04:34:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-12-19 04:34:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 6836 transitions. [2019-12-19 04:34:45,536 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 6836 transitions. Word has length 93 [2019-12-19 04:34:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:45,537 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 6836 transitions. [2019-12-19 04:34:45,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 6836 transitions. [2019-12-19 04:34:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:45,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:45,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:45,541 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-19 04:34:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:45,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008290909] [2019-12-19 04:34:45,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:45,643 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 04:34:45,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008290909] [2019-12-19 04:34:45,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:45,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:45,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365903018] [2019-12-19 04:34:45,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:45,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:45,645 INFO L87 Difference]: Start difference. First operand 2900 states and 6836 transitions. Second operand 6 states. [2019-12-19 04:34:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:45,841 INFO L93 Difference]: Finished difference Result 2729 states and 6293 transitions. [2019-12-19 04:34:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:45,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:45,847 INFO L225 Difference]: With dead ends: 2729 [2019-12-19 04:34:45,847 INFO L226 Difference]: Without dead ends: 2729 [2019-12-19 04:34:45,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-12-19 04:34:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1987. [2019-12-19 04:34:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-19 04:34:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-19 04:34:45,893 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-19 04:34:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:45,893 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-19 04:34:45,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-19 04:34:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:45,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:45,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:45,898 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-19 04:34:45,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:45,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127792385] [2019-12-19 04:34:45,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:46,044 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 04:34:46,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127792385] [2019-12-19 04:34:46,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:46,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:46,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915076832] [2019-12-19 04:34:46,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:46,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:46,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:46,047 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 6 states. [2019-12-19 04:34:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:46,260 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-19 04:34:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:34:46,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:34:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:46,264 INFO L225 Difference]: With dead ends: 2215 [2019-12-19 04:34:46,264 INFO L226 Difference]: Without dead ends: 2215 [2019-12-19 04:34:46,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 04:34:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-19 04:34:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-19 04:34:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-19 04:34:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-19 04:34:46,295 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-19 04:34:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:46,295 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-19 04:34:46,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-19 04:34:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:46,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:46,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:46,298 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-19 04:34:46,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:46,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817344730] [2019-12-19 04:34:46,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:46,407 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 04:34:46,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817344730] [2019-12-19 04:34:46,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:46,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:46,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829228939] [2019-12-19 04:34:46,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:46,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:46,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:46,412 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-19 04:34:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:46,639 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-19 04:34:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:46,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:34:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:46,644 INFO L225 Difference]: With dead ends: 2271 [2019-12-19 04:34:46,645 INFO L226 Difference]: Without dead ends: 2253 [2019-12-19 04:34:46,648 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 04:34:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-19 04:34:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-19 04:34:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-19 04:34:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-19 04:34:46,693 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-19 04:34:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:46,693 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-19 04:34:46,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-19 04:34:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:46,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:46,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:46,698 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:46,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:46,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-19 04:34:46,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:46,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868870020] [2019-12-19 04:34:46,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:46,814 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 04:34:46,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868870020] [2019-12-19 04:34:46,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:46,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:46,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894811401] [2019-12-19 04:34:46,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:46,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:46,816 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-19 04:34:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:46,957 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-19 04:34:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:46,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:34:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:46,961 INFO L225 Difference]: With dead ends: 2123 [2019-12-19 04:34:46,962 INFO L226 Difference]: Without dead ends: 2123 [2019-12-19 04:34:46,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-19 04:34:46,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-19 04:34:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-19 04:34:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-19 04:34:47,005 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-19 04:34:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:47,006 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-19 04:34:47,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-19 04:34:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:47,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:47,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:47,010 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-19 04:34:47,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:47,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908576705] [2019-12-19 04:34:47,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:47,196 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 04:34:47,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908576705] [2019-12-19 04:34:47,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:47,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:34:47,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27700230] [2019-12-19 04:34:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:34:47,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:34:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:47,198 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 8 states. [2019-12-19 04:34:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:47,296 INFO L93 Difference]: Finished difference Result 3367 states and 7933 transitions. [2019-12-19 04:34:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:47,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-19 04:34:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:47,298 INFO L225 Difference]: With dead ends: 3367 [2019-12-19 04:34:47,298 INFO L226 Difference]: Without dead ends: 1535 [2019-12-19 04:34:47,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:34:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2019-12-19 04:34:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1455. [2019-12-19 04:34:47,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-19 04:34:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-19 04:34:47,322 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-19 04:34:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:47,322 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-19 04:34:47,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:34:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-19 04:34:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:47,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:47,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:47,325 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-19 04:34:47,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:47,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811274022] [2019-12-19 04:34:47,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:47,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811274022] [2019-12-19 04:34:47,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:47,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:34:47,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172258868] [2019-12-19 04:34:47,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:34:47,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:34:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:34:47,497 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 11 states. [2019-12-19 04:34:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:47,750 INFO L93 Difference]: Finished difference Result 2624 states and 6270 transitions. [2019-12-19 04:34:47,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:34:47,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-19 04:34:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:47,754 INFO L225 Difference]: With dead ends: 2624 [2019-12-19 04:34:47,754 INFO L226 Difference]: Without dead ends: 1985 [2019-12-19 04:34:47,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:34:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-12-19 04:34:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1873. [2019-12-19 04:34:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-19 04:34:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4324 transitions. [2019-12-19 04:34:47,773 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4324 transitions. Word has length 95 [2019-12-19 04:34:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:47,773 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4324 transitions. [2019-12-19 04:34:47,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:34:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4324 transitions. [2019-12-19 04:34:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:47,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:47,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:47,775 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-19 04:34:47,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:47,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694678377] [2019-12-19 04:34:47,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:34:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:34:47,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:34:47,859 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:34:47,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:34:47 BasicIcfg [2019-12-19 04:34:47,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:34:47,995 INFO L168 Benchmark]: Toolchain (without parser) took 61083.30 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.1 MB in the beginning and 1.0 GB in the end (delta: -913.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,996 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.68 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,997 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,997 INFO L168 Benchmark]: RCFGBuilder took 766.00 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:47,998 INFO L168 Benchmark]: TraceAbstraction took 59409.94 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.9 MB in the beginning and 1.0 GB in the end (delta: -908.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 04:34:48,000 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.51 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.68 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 201.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.31 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.00 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59409.94 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.9 MB in the beginning and 1.0 GB in the end (delta: -908.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2017; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 59.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9953 SDtfs, 10503 SDslu, 22865 SDs, 0 SdLazy, 9496 SolverSat, 631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 107 SyntacticMatches, 25 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 168101 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2947 NumberOfCodeBlocks, 2947 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2815 ConstructedInterpolants, 0 QuantifiedInterpolants, 514027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...