/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/rfi001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:43:54,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:43:54,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:43:54,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:43:54,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:43:54,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:43:54,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:43:54,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:43:54,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:43:54,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:43:54,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:43:54,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:43:54,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:43:54,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:43:54,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:43:54,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:43:54,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:43:54,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:43:54,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:43:54,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:43:54,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:43:54,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:43:54,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:43:54,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:43:54,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:43:54,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:43:54,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:43:54,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:43:54,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:43:54,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:43:54,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:43:54,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:43:54,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:43:54,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:43:54,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:43:54,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:43:54,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:43:54,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:43:54,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:43:54,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:43:54,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:43:54,953 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 03:43:54,986 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:43:54,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:43:54,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:43:54,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:43:54,988 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:43:54,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:43:54,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:43:54,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:43:54,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:43:54,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:43:54,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:43:54,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:43:54,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:43:54,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:43:54,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:43:54,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:43:54,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:43:54,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:43:54,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:43:54,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:43:54,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:43:54,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:43:54,995 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:43:54,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:43:54,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:43:55,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:43:55,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:43:55,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:43:55,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:43:55,275 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:43:55,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2019-12-19 03:43:55,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39cff8/e46f7e67d08a4fdc8c557a87bb002899/FLAG9620752a4 [2019-12-19 03:43:55,887 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:43:55,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2019-12-19 03:43:55,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39cff8/e46f7e67d08a4fdc8c557a87bb002899/FLAG9620752a4 [2019-12-19 03:43:56,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde39cff8/e46f7e67d08a4fdc8c557a87bb002899 [2019-12-19 03:43:56,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:43:56,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:43:56,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:43:56,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:43:56,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:43:56,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:56,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56, skipping insertion in model container [2019-12-19 03:43:56,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:56,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:43:56,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:43:56,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:43:56,791 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:43:56,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:43:56,924 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:43:56,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56 WrapperNode [2019-12-19 03:43:56,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:43:56,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:43:56,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:43:56,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:43:56,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:56,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:56,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:43:57,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:43:57,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:43:57,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:43:57,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (1/1) ... [2019-12-19 03:43:57,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:43:57,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:43:57,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:43:57,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:43:57,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (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 03:43:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:43:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:43:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:43:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:43:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:43:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:43:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:43:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:43:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:43:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:43:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:43:57,109 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 03:43:57,800 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:43:57,800 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:43:57,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:43:57 BoogieIcfgContainer [2019-12-19 03:43:57,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:43:57,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:43:57,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:43:57,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:43:57,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:43:56" (1/3) ... [2019-12-19 03:43:57,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7920e022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:43:57, skipping insertion in model container [2019-12-19 03:43:57,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:43:56" (2/3) ... [2019-12-19 03:43:57,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7920e022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:43:57, skipping insertion in model container [2019-12-19 03:43:57,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:43:57" (3/3) ... [2019-12-19 03:43:57,811 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt.i [2019-12-19 03:43:57,822 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:43:57,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:43:57,836 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:43:57,837 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:43:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,891 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,900 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,901 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:43:57,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:43:57,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:43:57,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:43:57,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:43:57,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:43:57,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:43:57,999 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:43:57,999 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:43:57,999 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:43:58,022 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 03:43:59,275 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-19 03:43:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-19 03:43:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 03:43:59,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:43:59,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:43:59,288 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:43:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:43:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1922426572, now seen corresponding path program 1 times [2019-12-19 03:43:59,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:43:59,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758650500] [2019-12-19 03:43:59,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:43:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:43:59,739 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 03:43:59,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758650500] [2019-12-19 03:43:59,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:43:59,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:43:59,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598764856] [2019-12-19 03:43:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:43:59,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:43:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:43:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:43:59,765 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-19 03:44:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:00,336 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-19 03:44:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:44:00,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 03:44:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:00,552 INFO L225 Difference]: With dead ends: 23448 [2019-12-19 03:44:00,552 INFO L226 Difference]: Without dead ends: 21272 [2019-12-19 03:44:00,555 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 03:44:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-19 03:44:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-19 03:44:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-19 03:44:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-19 03:44:02,355 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-19 03:44:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:02,356 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-19 03:44:02,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:44:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-19 03:44:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:44:02,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:02,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:02,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash -184333443, now seen corresponding path program 1 times [2019-12-19 03:44:02,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:02,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345900991] [2019-12-19 03:44:02,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:02,544 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 03:44:02,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345900991] [2019-12-19 03:44:02,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:02,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:02,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719823434] [2019-12-19 03:44:02,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:02,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:02,548 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-19 03:44:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:03,703 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-19 03:44:03,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:03,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:44:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:03,870 INFO L225 Difference]: With dead ends: 34706 [2019-12-19 03:44:03,871 INFO L226 Difference]: Without dead ends: 34562 [2019-12-19 03:44:03,872 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 03:44:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-19 03:44:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-19 03:44:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-19 03:44:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-19 03:44:06,136 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-19 03:44:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:06,138 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-19 03:44:06,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-19 03:44:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 03:44:06,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:06,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:06,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2043575512, now seen corresponding path program 1 times [2019-12-19 03:44:06,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:06,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421876697] [2019-12-19 03:44:06,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:06,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421876697] [2019-12-19 03:44:06,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:06,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:06,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518609696] [2019-12-19 03:44:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:06,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:06,254 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-19 03:44:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:06,862 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-19 03:44:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:06,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 03:44:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:07,404 INFO L225 Difference]: With dead ends: 40214 [2019-12-19 03:44:07,405 INFO L226 Difference]: Without dead ends: 40054 [2019-12-19 03:44:07,405 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 03:44:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-19 03:44:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-19 03:44:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-19 03:44:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-19 03:44:09,816 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-19 03:44:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:09,817 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-19 03:44:09,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-19 03:44:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:44:09,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:09,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:09,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1974753575, now seen corresponding path program 1 times [2019-12-19 03:44:09,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:09,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135332686] [2019-12-19 03:44:09,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:09,918 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 03:44:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135332686] [2019-12-19 03:44:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:09,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:09,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150359586] [2019-12-19 03:44:09,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:09,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:09,921 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-19 03:44:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:11,025 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-19 03:44:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:44:11,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:44:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:11,196 INFO L225 Difference]: With dead ends: 45663 [2019-12-19 03:44:11,197 INFO L226 Difference]: Without dead ends: 45519 [2019-12-19 03:44:11,199 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 03:44:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-19 03:44:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-19 03:44:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-19 03:44:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-19 03:44:13,678 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-19 03:44:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:13,678 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-19 03:44:13,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-19 03:44:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:44:13,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:13,712 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 03:44:13,712 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 194121141, now seen corresponding path program 1 times [2019-12-19 03:44:13,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:13,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269141428] [2019-12-19 03:44:13,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:13,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269141428] [2019-12-19 03:44:13,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:13,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:13,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038136970] [2019-12-19 03:44:13,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:13,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:13,845 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-19 03:44:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:14,522 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-19 03:44:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:44:14,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 03:44:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:14,960 INFO L225 Difference]: With dead ends: 46070 [2019-12-19 03:44:14,961 INFO L226 Difference]: Without dead ends: 45830 [2019-12-19 03:44:14,961 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 03:44:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-19 03:44:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-19 03:44:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-19 03:44:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-19 03:44:17,654 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-19 03:44:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:17,654 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-19 03:44:17,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-19 03:44:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 03:44:17,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:17,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:17,685 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1160701436, now seen corresponding path program 1 times [2019-12-19 03:44:17,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:17,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282766907] [2019-12-19 03:44:17,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:17,774 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 03:44:17,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282766907] [2019-12-19 03:44:17,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:17,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:44:17,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823622982] [2019-12-19 03:44:17,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:44:17,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:44:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:44:17,777 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-19 03:44:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:18,057 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-19 03:44:18,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:44:18,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-19 03:44:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:18,160 INFO L225 Difference]: With dead ends: 50257 [2019-12-19 03:44:18,160 INFO L226 Difference]: Without dead ends: 50257 [2019-12-19 03:44:18,160 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 03:44:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-19 03:44:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-19 03:44:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-19 03:44:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-19 03:44:19,216 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-19 03:44:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:19,216 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-19 03:44:19,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:44:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-19 03:44:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:44:19,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:19,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:19,261 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:19,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:19,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1771534722, now seen corresponding path program 1 times [2019-12-19 03:44:19,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:19,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736595537] [2019-12-19 03:44:19,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:19,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736595537] [2019-12-19 03:44:19,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:19,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:44:19,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809223763] [2019-12-19 03:44:19,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:44:19,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:19,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:44:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:19,344 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-19 03:44:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:20,736 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-19 03:44:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:44:20,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:44:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:20,865 INFO L225 Difference]: With dead ends: 55885 [2019-12-19 03:44:20,865 INFO L226 Difference]: Without dead ends: 55645 [2019-12-19 03:44:20,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 03:44:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-19 03:44:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-19 03:44:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-19 03:44:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-19 03:44:23,714 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-19 03:44:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:23,714 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-19 03:44:23,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:44:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-19 03:44:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:44:23,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:23,752 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 03:44:23,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash -93886554, now seen corresponding path program 1 times [2019-12-19 03:44:23,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:23,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593521145] [2019-12-19 03:44:23,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:23,831 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 03:44:23,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593521145] [2019-12-19 03:44:23,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:23,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:44:23,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026154183] [2019-12-19 03:44:23,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:44:23,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:44:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:23,833 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-19 03:44:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:24,929 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-19 03:44:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:44:24,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 03:44:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:25,035 INFO L225 Difference]: With dead ends: 55099 [2019-12-19 03:44:25,036 INFO L226 Difference]: Without dead ends: 54899 [2019-12-19 03:44:25,036 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 03:44:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-19 03:44:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-19 03:44:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-19 03:44:26,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-19 03:44:26,231 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-19 03:44:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:26,231 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-19 03:44:26,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:44:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-19 03:44:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:44:26,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:26,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:26,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash 796822408, now seen corresponding path program 1 times [2019-12-19 03:44:26,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094840521] [2019-12-19 03:44:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:26,389 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 03:44:26,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094840521] [2019-12-19 03:44:26,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:26,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:26,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370213548] [2019-12-19 03:44:26,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:26,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:26,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:26,392 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-19 03:44:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:27,713 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-19 03:44:27,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:27,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 03:44:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:27,839 INFO L225 Difference]: With dead ends: 65553 [2019-12-19 03:44:27,840 INFO L226 Difference]: Without dead ends: 64909 [2019-12-19 03:44:27,840 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 03:44:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-19 03:44:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-19 03:44:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-19 03:44:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-19 03:44:29,403 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-19 03:44:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:29,404 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-19 03:44:29,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-19 03:44:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:44:29,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:29,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:29,453 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1758436425, now seen corresponding path program 1 times [2019-12-19 03:44:29,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:29,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566695197] [2019-12-19 03:44:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:29,562 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 03:44:29,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566695197] [2019-12-19 03:44:29,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:29,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:44:29,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160871187] [2019-12-19 03:44:29,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:44:29,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:44:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:29,564 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-19 03:44:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:30,731 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-19 03:44:30,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:44:30,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 03:44:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:30,907 INFO L225 Difference]: With dead ends: 83031 [2019-12-19 03:44:30,908 INFO L226 Difference]: Without dead ends: 83031 [2019-12-19 03:44:30,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:44:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-19 03:44:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-19 03:44:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-19 03:44:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-19 03:44:34,939 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-19 03:44:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:34,939 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-19 03:44:34,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:44:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-19 03:44:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:44:35,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:35,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:35,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1291766390, now seen corresponding path program 1 times [2019-12-19 03:44:35,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:35,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170048187] [2019-12-19 03:44:35,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:35,078 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 03:44:35,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170048187] [2019-12-19 03:44:35,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:35,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:44:35,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001421149] [2019-12-19 03:44:35,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:44:35,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:44:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:44:35,080 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-19 03:44:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:35,932 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-19 03:44:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:44:35,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 03:44:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:36,065 INFO L225 Difference]: With dead ends: 54416 [2019-12-19 03:44:36,066 INFO L226 Difference]: Without dead ends: 54254 [2019-12-19 03:44:36,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:44:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-19 03:44:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-19 03:44:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-19 03:44:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-19 03:44:37,002 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-19 03:44:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:37,002 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-19 03:44:37,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:44:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-19 03:44:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 03:44:37,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:37,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:37,037 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1538482368, now seen corresponding path program 1 times [2019-12-19 03:44:37,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:37,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411965514] [2019-12-19 03:44:37,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:37,121 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 03:44:37,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411965514] [2019-12-19 03:44:37,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:37,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:37,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542942498] [2019-12-19 03:44:37,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:37,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:37,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:37,124 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 5 states. [2019-12-19 03:44:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:39,390 INFO L93 Difference]: Finished difference Result 84429 states and 303657 transitions. [2019-12-19 03:44:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:44:39,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 03:44:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:39,566 INFO L225 Difference]: With dead ends: 84429 [2019-12-19 03:44:39,566 INFO L226 Difference]: Without dead ends: 84233 [2019-12-19 03:44:39,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84233 states. [2019-12-19 03:44:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84233 to 76148. [2019-12-19 03:44:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76148 states. [2019-12-19 03:44:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76148 states to 76148 states and 275545 transitions. [2019-12-19 03:44:41,278 INFO L78 Accepts]: Start accepts. Automaton has 76148 states and 275545 transitions. Word has length 71 [2019-12-19 03:44:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:41,278 INFO L462 AbstractCegarLoop]: Abstraction has 76148 states and 275545 transitions. [2019-12-19 03:44:41,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 76148 states and 275545 transitions. [2019-12-19 03:44:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 03:44:41,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:41,338 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] [2019-12-19 03:44:41,338 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash -293717887, now seen corresponding path program 1 times [2019-12-19 03:44:41,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:41,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508699892] [2019-12-19 03:44:41,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:41,438 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 03:44:41,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508699892] [2019-12-19 03:44:41,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:41,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623417763] [2019-12-19 03:44:41,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:41,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:41,441 INFO L87 Difference]: Start difference. First operand 76148 states and 275545 transitions. Second operand 5 states. [2019-12-19 03:44:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:41,581 INFO L93 Difference]: Finished difference Result 19616 states and 62266 transitions. [2019-12-19 03:44:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:44:41,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 03:44:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:41,618 INFO L225 Difference]: With dead ends: 19616 [2019-12-19 03:44:41,618 INFO L226 Difference]: Without dead ends: 19138 [2019-12-19 03:44:41,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-19 03:44:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-19 03:44:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-19 03:44:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60761 transitions. [2019-12-19 03:44:41,864 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60761 transitions. Word has length 71 [2019-12-19 03:44:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:41,864 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60761 transitions. [2019-12-19 03:44:41,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60761 transitions. [2019-12-19 03:44:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 03:44:41,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:41,886 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 03:44:41,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1162099754, now seen corresponding path program 1 times [2019-12-19 03:44:41,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:41,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040546339] [2019-12-19 03:44:41,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:41,941 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 03:44:41,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040546339] [2019-12-19 03:44:41,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:41,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:44:41,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670858583] [2019-12-19 03:44:41,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:44:41,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:44:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:44:41,943 INFO L87 Difference]: Start difference. First operand 19126 states and 60761 transitions. Second operand 4 states. [2019-12-19 03:44:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:42,219 INFO L93 Difference]: Finished difference Result 24076 states and 75429 transitions. [2019-12-19 03:44:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:44:42,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 03:44:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:42,270 INFO L225 Difference]: With dead ends: 24076 [2019-12-19 03:44:42,270 INFO L226 Difference]: Without dead ends: 24076 [2019-12-19 03:44:42,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-12-19 03:44:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 19966. [2019-12-19 03:44:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-19 03:44:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 63128 transitions. [2019-12-19 03:44:42,565 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 63128 transitions. Word has length 80 [2019-12-19 03:44:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:42,565 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 63128 transitions. [2019-12-19 03:44:42,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:44:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 63128 transitions. [2019-12-19 03:44:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 03:44:42,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:42,580 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 03:44:42,580 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 907363209, now seen corresponding path program 1 times [2019-12-19 03:44:42,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:42,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348646737] [2019-12-19 03:44:42,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:42,670 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 03:44:42,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348646737] [2019-12-19 03:44:42,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:42,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:44:42,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732059034] [2019-12-19 03:44:42,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:44:42,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:44:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:44:42,672 INFO L87 Difference]: Start difference. First operand 19966 states and 63128 transitions. Second operand 8 states. [2019-12-19 03:44:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:43,864 INFO L93 Difference]: Finished difference Result 22072 states and 69320 transitions. [2019-12-19 03:44:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 03:44:43,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 03:44:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:43,910 INFO L225 Difference]: With dead ends: 22072 [2019-12-19 03:44:43,911 INFO L226 Difference]: Without dead ends: 22024 [2019-12-19 03:44:43,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-19 03:44:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-19 03:44:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19438. [2019-12-19 03:44:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19438 states. [2019-12-19 03:44:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19438 states to 19438 states and 61630 transitions. [2019-12-19 03:44:44,186 INFO L78 Accepts]: Start accepts. Automaton has 19438 states and 61630 transitions. Word has length 80 [2019-12-19 03:44:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:44,186 INFO L462 AbstractCegarLoop]: Abstraction has 19438 states and 61630 transitions. [2019-12-19 03:44:44,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:44:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19438 states and 61630 transitions. [2019-12-19 03:44:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:44:44,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:44,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:44,203 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1999994915, now seen corresponding path program 1 times [2019-12-19 03:44:44,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:44,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588080972] [2019-12-19 03:44:44,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:44,311 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 03:44:44,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588080972] [2019-12-19 03:44:44,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:44,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:44:44,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351650917] [2019-12-19 03:44:44,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:44:44,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:44:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:44:44,313 INFO L87 Difference]: Start difference. First operand 19438 states and 61630 transitions. Second operand 8 states. [2019-12-19 03:44:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:46,940 INFO L93 Difference]: Finished difference Result 50432 states and 153648 transitions. [2019-12-19 03:44:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 03:44:46,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-19 03:44:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:47,018 INFO L225 Difference]: With dead ends: 50432 [2019-12-19 03:44:47,019 INFO L226 Difference]: Without dead ends: 49733 [2019-12-19 03:44:47,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 03:44:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49733 states. [2019-12-19 03:44:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49733 to 29966. [2019-12-19 03:44:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-19 03:44:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93560 transitions. [2019-12-19 03:44:47,866 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93560 transitions. Word has length 83 [2019-12-19 03:44:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:47,866 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93560 transitions. [2019-12-19 03:44:47,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:44:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93560 transitions. [2019-12-19 03:44:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:44:47,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:47,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:47,898 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1038380898, now seen corresponding path program 1 times [2019-12-19 03:44:47,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:47,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133410223] [2019-12-19 03:44:47,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:47,996 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 03:44:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133410223] [2019-12-19 03:44:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:47,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:47,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912831574] [2019-12-19 03:44:47,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:47,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:47,998 INFO L87 Difference]: Start difference. First operand 29966 states and 93560 transitions. Second operand 6 states. [2019-12-19 03:44:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:48,543 INFO L93 Difference]: Finished difference Result 31404 states and 97497 transitions. [2019-12-19 03:44:48,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:48,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 03:44:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:48,595 INFO L225 Difference]: With dead ends: 31404 [2019-12-19 03:44:48,595 INFO L226 Difference]: Without dead ends: 31404 [2019-12-19 03:44:48,595 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 03:44:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-19 03:44:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 29635. [2019-12-19 03:44:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-19 03:44:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 92403 transitions. [2019-12-19 03:44:49,031 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 92403 transitions. Word has length 83 [2019-12-19 03:44:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:49,032 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 92403 transitions. [2019-12-19 03:44:49,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 92403 transitions. [2019-12-19 03:44:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:44:49,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:49,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:49,058 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1320926111, now seen corresponding path program 1 times [2019-12-19 03:44:49,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:49,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849925574] [2019-12-19 03:44:49,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:49,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849925574] [2019-12-19 03:44:49,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:49,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:44:49,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648512966] [2019-12-19 03:44:49,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:44:49,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:49,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:44:49,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:49,162 INFO L87 Difference]: Start difference. First operand 29635 states and 92403 transitions. Second operand 7 states. [2019-12-19 03:44:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:49,723 INFO L93 Difference]: Finished difference Result 31149 states and 96559 transitions. [2019-12-19 03:44:49,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:44:49,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-19 03:44:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:49,769 INFO L225 Difference]: With dead ends: 31149 [2019-12-19 03:44:49,769 INFO L226 Difference]: Without dead ends: 31149 [2019-12-19 03:44:49,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:44:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2019-12-19 03:44:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 29967. [2019-12-19 03:44:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-19 03:44:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 93234 transitions. [2019-12-19 03:44:50,156 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 93234 transitions. Word has length 83 [2019-12-19 03:44:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:50,156 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 93234 transitions. [2019-12-19 03:44:50,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:44:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 93234 transitions. [2019-12-19 03:44:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:44:50,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:50,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:50,185 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1650691872, now seen corresponding path program 1 times [2019-12-19 03:44:50,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:50,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385593708] [2019-12-19 03:44:50,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:50,275 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 03:44:50,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385593708] [2019-12-19 03:44:50,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:50,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:50,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107577843] [2019-12-19 03:44:50,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:50,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:50,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:50,278 INFO L87 Difference]: Start difference. First operand 29967 states and 93234 transitions. Second operand 5 states. [2019-12-19 03:44:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:50,329 INFO L93 Difference]: Finished difference Result 4530 states and 11170 transitions. [2019-12-19 03:44:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:44:50,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-19 03:44:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:50,334 INFO L225 Difference]: With dead ends: 4530 [2019-12-19 03:44:50,335 INFO L226 Difference]: Without dead ends: 3740 [2019-12-19 03:44:50,335 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 03:44:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2019-12-19 03:44:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3437. [2019-12-19 03:44:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2019-12-19 03:44:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 8371 transitions. [2019-12-19 03:44:50,385 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 8371 transitions. Word has length 83 [2019-12-19 03:44:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:50,385 INFO L462 AbstractCegarLoop]: Abstraction has 3437 states and 8371 transitions. [2019-12-19 03:44:50,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 8371 transitions. [2019-12-19 03:44:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:50,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:50,390 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 03:44:50,390 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -843880616, now seen corresponding path program 1 times [2019-12-19 03:44:50,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:50,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309759774] [2019-12-19 03:44:50,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:50,483 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 03:44:50,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309759774] [2019-12-19 03:44:50,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:50,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:50,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905056509] [2019-12-19 03:44:50,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:50,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:50,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:50,485 INFO L87 Difference]: Start difference. First operand 3437 states and 8371 transitions. Second operand 6 states. [2019-12-19 03:44:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:50,912 INFO L93 Difference]: Finished difference Result 3716 states and 8919 transitions. [2019-12-19 03:44:50,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:50,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:44:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:50,920 INFO L225 Difference]: With dead ends: 3716 [2019-12-19 03:44:50,920 INFO L226 Difference]: Without dead ends: 3670 [2019-12-19 03:44:50,920 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 03:44:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-19 03:44:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3580. [2019-12-19 03:44:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-19 03:44:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8658 transitions. [2019-12-19 03:44:50,996 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8658 transitions. Word has length 95 [2019-12-19 03:44:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:50,997 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8658 transitions. [2019-12-19 03:44:50,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8658 transitions. [2019-12-19 03:44:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:51,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:51,004 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 03:44:51,004 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 285188987, now seen corresponding path program 1 times [2019-12-19 03:44:51,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:51,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40290302] [2019-12-19 03:44:51,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:51,085 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 03:44:51,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40290302] [2019-12-19 03:44:51,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:51,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:51,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709736606] [2019-12-19 03:44:51,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:51,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:51,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:51,088 INFO L87 Difference]: Start difference. First operand 3580 states and 8658 transitions. Second operand 5 states. [2019-12-19 03:44:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:51,401 INFO L93 Difference]: Finished difference Result 4418 states and 10489 transitions. [2019-12-19 03:44:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:44:51,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:44:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:51,410 INFO L225 Difference]: With dead ends: 4418 [2019-12-19 03:44:51,411 INFO L226 Difference]: Without dead ends: 4377 [2019-12-19 03:44:51,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:44:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2019-12-19 03:44:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 3845. [2019-12-19 03:44:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2019-12-19 03:44:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 9231 transitions. [2019-12-19 03:44:51,496 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 9231 transitions. Word has length 95 [2019-12-19 03:44:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:51,497 INFO L462 AbstractCegarLoop]: Abstraction has 3845 states and 9231 transitions. [2019-12-19 03:44:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 9231 transitions. [2019-12-19 03:44:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:51,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:51,506 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 03:44:51,506 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash -637494596, now seen corresponding path program 1 times [2019-12-19 03:44:51,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:51,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564949840] [2019-12-19 03:44:51,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:51,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564949840] [2019-12-19 03:44:51,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:51,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:44:51,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432231062] [2019-12-19 03:44:51,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:44:51,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:44:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:44:51,688 INFO L87 Difference]: Start difference. First operand 3845 states and 9231 transitions. Second operand 7 states. [2019-12-19 03:44:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:52,412 INFO L93 Difference]: Finished difference Result 6165 states and 14551 transitions. [2019-12-19 03:44:52,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:44:52,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 03:44:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:52,421 INFO L225 Difference]: With dead ends: 6165 [2019-12-19 03:44:52,421 INFO L226 Difference]: Without dead ends: 6064 [2019-12-19 03:44:52,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:44:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2019-12-19 03:44:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 4059. [2019-12-19 03:44:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4059 states. [2019-12-19 03:44:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 9687 transitions. [2019-12-19 03:44:52,487 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 9687 transitions. Word has length 95 [2019-12-19 03:44:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:52,487 INFO L462 AbstractCegarLoop]: Abstraction has 4059 states and 9687 transitions. [2019-12-19 03:44:52,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:44:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 9687 transitions. [2019-12-19 03:44:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:52,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:52,492 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 03:44:52,492 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:52,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1721812413, now seen corresponding path program 1 times [2019-12-19 03:44:52,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:52,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166702180] [2019-12-19 03:44:52,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:52,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 03:44:52,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166702180] [2019-12-19 03:44:52,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:52,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:52,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751660496] [2019-12-19 03:44:52,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:52,635 INFO L87 Difference]: Start difference. First operand 4059 states and 9687 transitions. Second operand 6 states. [2019-12-19 03:44:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:52,793 INFO L93 Difference]: Finished difference Result 4800 states and 11049 transitions. [2019-12-19 03:44:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:44:52,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:44:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:52,801 INFO L225 Difference]: With dead ends: 4800 [2019-12-19 03:44:52,801 INFO L226 Difference]: Without dead ends: 4759 [2019-12-19 03:44:52,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:44:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2019-12-19 03:44:52,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 4171. [2019-12-19 03:44:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-12-19 03:44:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 9813 transitions. [2019-12-19 03:44:52,859 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 9813 transitions. Word has length 95 [2019-12-19 03:44:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:52,859 INFO L462 AbstractCegarLoop]: Abstraction has 4171 states and 9813 transitions. [2019-12-19 03:44:52,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 9813 transitions. [2019-12-19 03:44:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:52,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:52,864 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 03:44:52,865 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2051578174, now seen corresponding path program 1 times [2019-12-19 03:44:52,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:52,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721417932] [2019-12-19 03:44:52,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:52,949 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 03:44:52,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721417932] [2019-12-19 03:44:52,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:52,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:44:52,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783204301] [2019-12-19 03:44:52,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:44:52,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:44:52,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:44:52,951 INFO L87 Difference]: Start difference. First operand 4171 states and 9813 transitions. Second operand 6 states. [2019-12-19 03:44:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:53,225 INFO L93 Difference]: Finished difference Result 4507 states and 10513 transitions. [2019-12-19 03:44:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:44:53,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:44:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:53,231 INFO L225 Difference]: With dead ends: 4507 [2019-12-19 03:44:53,231 INFO L226 Difference]: Without dead ends: 4507 [2019-12-19 03:44:53,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:44:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-19 03:44:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3873. [2019-12-19 03:44:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-12-19 03:44:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 9117 transitions. [2019-12-19 03:44:53,268 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 9117 transitions. Word has length 95 [2019-12-19 03:44:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:53,268 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 9117 transitions. [2019-12-19 03:44:53,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:44:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 9117 transitions. [2019-12-19 03:44:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:53,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:53,272 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 03:44:53,272 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:53,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 41474333, now seen corresponding path program 1 times [2019-12-19 03:44:53,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:53,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14795354] [2019-12-19 03:44:53,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:53,340 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 03:44:53,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14795354] [2019-12-19 03:44:53,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:53,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:44:53,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585641517] [2019-12-19 03:44:53,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:44:53,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:44:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:44:53,342 INFO L87 Difference]: Start difference. First operand 3873 states and 9117 transitions. Second operand 4 states. [2019-12-19 03:44:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:53,558 INFO L93 Difference]: Finished difference Result 4179 states and 9813 transitions. [2019-12-19 03:44:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:44:53,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-19 03:44:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:53,566 INFO L225 Difference]: With dead ends: 4179 [2019-12-19 03:44:53,566 INFO L226 Difference]: Without dead ends: 4143 [2019-12-19 03:44:53,566 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 03:44:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2019-12-19 03:44:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 3873. [2019-12-19 03:44:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-12-19 03:44:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 9099 transitions. [2019-12-19 03:44:53,604 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 9099 transitions. Word has length 95 [2019-12-19 03:44:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:53,605 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 9099 transitions. [2019-12-19 03:44:53,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:44:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 9099 transitions. [2019-12-19 03:44:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:53,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:53,608 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 03:44:53,608 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash -241676131, now seen corresponding path program 1 times [2019-12-19 03:44:53,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:53,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740981047] [2019-12-19 03:44:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:44:53,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740981047] [2019-12-19 03:44:53,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:53,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:53,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266410759] [2019-12-19 03:44:53,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:53,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:53,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:53,681 INFO L87 Difference]: Start difference. First operand 3873 states and 9099 transitions. Second operand 5 states. [2019-12-19 03:44:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:53,926 INFO L93 Difference]: Finished difference Result 3693 states and 8535 transitions. [2019-12-19 03:44:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:44:53,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:44:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:53,932 INFO L225 Difference]: With dead ends: 3693 [2019-12-19 03:44:53,932 INFO L226 Difference]: Without dead ends: 3675 [2019-12-19 03:44:53,932 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 03:44:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-12-19 03:44:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 2644. [2019-12-19 03:44:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2019-12-19 03:44:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 6157 transitions. [2019-12-19 03:44:53,992 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 6157 transitions. Word has length 95 [2019-12-19 03:44:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:53,992 INFO L462 AbstractCegarLoop]: Abstraction has 2644 states and 6157 transitions. [2019-12-19 03:44:53,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 6157 transitions. [2019-12-19 03:44:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:44:53,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:53,996 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 03:44:53,996 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1003088350, now seen corresponding path program 1 times [2019-12-19 03:44:53,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:53,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963263591] [2019-12-19 03:44:53,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:54,085 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 03:44:54,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963263591] [2019-12-19 03:44:54,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:54,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:44:54,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675664219] [2019-12-19 03:44:54,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:44:54,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:44:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:44:54,088 INFO L87 Difference]: Start difference. First operand 2644 states and 6157 transitions. Second operand 3 states. [2019-12-19 03:44:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:54,116 INFO L93 Difference]: Finished difference Result 2379 states and 5522 transitions. [2019-12-19 03:44:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:44:54,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-19 03:44:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:54,120 INFO L225 Difference]: With dead ends: 2379 [2019-12-19 03:44:54,120 INFO L226 Difference]: Without dead ends: 2361 [2019-12-19 03:44:54,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:44:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-12-19 03:44:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2261. [2019-12-19 03:44:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-12-19 03:44:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5287 transitions. [2019-12-19 03:44:54,164 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5287 transitions. Word has length 95 [2019-12-19 03:44:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 5287 transitions. [2019-12-19 03:44:54,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:44:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5287 transitions. [2019-12-19 03:44:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:44:54,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:54,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:54,169 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash 756751223, now seen corresponding path program 1 times [2019-12-19 03:44:54,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:54,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024388895] [2019-12-19 03:44:54,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:54,255 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 03:44:54,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024388895] [2019-12-19 03:44:54,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:54,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:54,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789249023] [2019-12-19 03:44:54,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:54,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:54,257 INFO L87 Difference]: Start difference. First operand 2261 states and 5287 transitions. Second operand 5 states. [2019-12-19 03:44:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:54,351 INFO L93 Difference]: Finished difference Result 2206 states and 5152 transitions. [2019-12-19 03:44:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:44:54,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 03:44:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:54,355 INFO L225 Difference]: With dead ends: 2206 [2019-12-19 03:44:54,355 INFO L226 Difference]: Without dead ends: 2206 [2019-12-19 03:44:54,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 03:44:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2019-12-19 03:44:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2184. [2019-12-19 03:44:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-19 03:44:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5106 transitions. [2019-12-19 03:44:54,380 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5106 transitions. Word has length 97 [2019-12-19 03:44:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:54,381 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 5106 transitions. [2019-12-19 03:44:54,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5106 transitions. [2019-12-19 03:44:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:44:54,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:54,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:54,383 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1696531523, now seen corresponding path program 1 times [2019-12-19 03:44:54,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:54,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715068905] [2019-12-19 03:44:54,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:54,461 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 03:44:54,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715068905] [2019-12-19 03:44:54,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:54,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:44:54,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50196783] [2019-12-19 03:44:54,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:44:54,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:54,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:44:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:44:54,463 INFO L87 Difference]: Start difference. First operand 2184 states and 5106 transitions. Second operand 5 states. [2019-12-19 03:44:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:54,498 INFO L93 Difference]: Finished difference Result 3125 states and 7441 transitions. [2019-12-19 03:44:54,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:44:54,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 03:44:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:54,503 INFO L225 Difference]: With dead ends: 3125 [2019-12-19 03:44:54,503 INFO L226 Difference]: Without dead ends: 3125 [2019-12-19 03:44:54,503 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 03:44:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2019-12-19 03:44:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2146. [2019-12-19 03:44:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-19 03:44:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4970 transitions. [2019-12-19 03:44:54,534 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4970 transitions. Word has length 97 [2019-12-19 03:44:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:54,535 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4970 transitions. [2019-12-19 03:44:54,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:44:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4970 transitions. [2019-12-19 03:44:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:44:54,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:54,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:54,538 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1415088476, now seen corresponding path program 1 times [2019-12-19 03:44:54,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:54,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631751257] [2019-12-19 03:44:54,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:44:54,652 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 03:44:54,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631751257] [2019-12-19 03:44:54,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:44:54,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:44:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792449491] [2019-12-19 03:44:54,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:44:54,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:44:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:44:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:44:54,654 INFO L87 Difference]: Start difference. First operand 2146 states and 4970 transitions. Second operand 8 states. [2019-12-19 03:44:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:44:54,803 INFO L93 Difference]: Finished difference Result 3515 states and 8250 transitions. [2019-12-19 03:44:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:44:54,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 03:44:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:44:54,807 INFO L225 Difference]: With dead ends: 3515 [2019-12-19 03:44:54,807 INFO L226 Difference]: Without dead ends: 1453 [2019-12-19 03:44:54,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:44:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-19 03:44:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1365. [2019-12-19 03:44:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-19 03:44:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3237 transitions. [2019-12-19 03:44:54,833 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3237 transitions. Word has length 97 [2019-12-19 03:44:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:44:54,833 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3237 transitions. [2019-12-19 03:44:54,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:44:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3237 transitions. [2019-12-19 03:44:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:44:54,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:44:54,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:44:54,836 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:44:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:44:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -466492236, now seen corresponding path program 2 times [2019-12-19 03:44:54,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:44:54,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40893693] [2019-12-19 03:44:54,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:44:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:44:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:44:55,031 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:44:55,032 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:44:55,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:44:55 BasicIcfg [2019-12-19 03:44:55,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:44:55,302 INFO L168 Benchmark]: Toolchain (without parser) took 59097.20 ms. Allocated memory was 147.3 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 102.4 MB in the beginning and 1.1 GB in the end (delta: -997.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,306 INFO L168 Benchmark]: CDTParser took 1.32 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.33 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.22 ms. Allocated memory is still 205.5 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,308 INFO L168 Benchmark]: Boogie Preprocessor took 37.38 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 154.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,308 INFO L168 Benchmark]: RCFGBuilder took 764.63 ms. Allocated memory is still 205.5 MB. Free memory was 154.6 MB in the beginning and 110.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,309 INFO L168 Benchmark]: TraceAbstraction took 57495.97 ms. Allocated memory was 205.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 109.6 MB in the beginning and 1.1 GB in the end (delta: -990.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 03:44:55,311 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.32 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.33 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.22 ms. Allocated memory is still 205.5 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.38 ms. Allocated memory is still 205.5 MB. Free memory was 156.5 MB in the beginning and 154.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 764.63 ms. Allocated memory is still 205.5 MB. Free memory was 154.6 MB in the beginning and 110.3 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57495.97 ms. Allocated memory was 205.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 109.6 MB in the beginning and 1.1 GB in the end (delta: -990.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 0 pthread_t t1603; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 0 pthread_t t1604; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 2 y$w_buff1 = y$w_buff0 [L747] 2 y$w_buff0 = 2 [L748] 2 y$w_buff1_used = y$w_buff0_used [L749] 2 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 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) [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L766] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 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 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L736] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 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 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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) [L798] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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 [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 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) [L809] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 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)) [L810] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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)) [L811] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 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)) [L812] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 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)) [L813] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 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)) [L814] 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, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 0 y = y$flush_delayed ? y$mem_tmp : y [L817] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 57.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7846 SDtfs, 8697 SDslu, 19225 SDs, 0 SdLazy, 9191 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 86 SyntacticMatches, 25 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76148occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 110525 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2310 ConstructedInterpolants, 0 QuantifiedInterpolants, 442092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...