/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_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:45:24,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:45:24,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:45:24,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:45:24,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:45:24,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:45:24,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:45:25,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:45:25,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:45:25,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:45:25,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:45:25,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:45:25,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:45:25,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:45:25,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:45:25,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:45:25,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:45:25,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:45:25,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:45:25,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:45:25,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:45:25,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:45:25,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:45:25,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:45:25,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:45:25,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:45:25,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:45:25,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:45:25,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:45:25,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:45:25,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:45:25,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:45:25,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:45:25,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:45:25,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:45:25,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:45:25,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:45:25,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:45:25,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:45:25,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:45:25,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:45:25,054 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:45:25,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:45:25,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:45:25,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:45:25,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:45:25,085 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:45:25,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:45:25,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:45:25,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:45:25,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:45:25,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:45:25,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:45:25,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:45:25,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:45:25,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:45:25,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:45:25,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:45:25,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:45:25,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:45:25,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:45:25,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:45:25,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:45:25,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:45:25,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:45:25,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:45:25,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:45:25,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:45:25,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:45:25,089 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:45:25,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:45:25,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:45:25,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:45:25,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:45:25,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:45:25,442 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:45:25,442 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:45:25,443 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-19 03:45:25,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7f4b707/3d5d817216204fbca52949c349df38fc/FLAG035dd1007 [2019-12-19 03:45:26,020 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:45:26,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2019-12-19 03:45:26,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7f4b707/3d5d817216204fbca52949c349df38fc/FLAG035dd1007 [2019-12-19 03:45:26,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7f4b707/3d5d817216204fbca52949c349df38fc [2019-12-19 03:45:26,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:45:26,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:45:26,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:45:26,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:45:26,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:45:26,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:45:26" (1/1) ... [2019-12-19 03:45:26,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c56d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:26, skipping insertion in model container [2019-12-19 03:45:26,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:45:26" (1/1) ... [2019-12-19 03:45:26,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:45:26,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:45:26,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:45:26,977 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:45:27,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:45:27,127 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:45:27,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27 WrapperNode [2019-12-19 03:45:27,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:45:27,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:45:27,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:45:27,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:45:27,138 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:45:27" (1/1) ... [2019-12-19 03:45:27,158 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:45:27" (1/1) ... [2019-12-19 03:45:27,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:45:27,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:45:27,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:45:27,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:45:27,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (1/1) ... [2019-12-19 03:45:27,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:45:27,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:45:27,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:45:27,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:45:27,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (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:45:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:45:27,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:45:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:45:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:45:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:45:27,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:45:27,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:45:27,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:45:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:45:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:45:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:45:27,325 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:45:28,010 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:45:28,011 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:45:28,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:45:28 BoogieIcfgContainer [2019-12-19 03:45:28,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:45:28,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:45:28,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:45:28,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:45:28,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:45:26" (1/3) ... [2019-12-19 03:45:28,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c5834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:45:28, skipping insertion in model container [2019-12-19 03:45:28,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:45:27" (2/3) ... [2019-12-19 03:45:28,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c5834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:45:28, skipping insertion in model container [2019-12-19 03:45:28,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:45:28" (3/3) ... [2019-12-19 03:45:28,028 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2019-12-19 03:45:28,039 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:45:28,040 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:45:28,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:45:28,049 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:45:28,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,085 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,094 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,108 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,111 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:45:28,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:45:28,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:45:28,155 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:45:28,155 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:45:28,155 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:45:28,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:45:28,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:45:28,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:45:28,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:45:28,170 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 03:45:29,659 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-19 03:45:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-19 03:45:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 03:45:29,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:29,671 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:45:29,672 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:45:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1922426572, now seen corresponding path program 1 times [2019-12-19 03:45:29,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:29,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164252579] [2019-12-19 03:45:29,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:30,007 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:45:30,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164252579] [2019-12-19 03:45:30,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:30,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:45:30,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666751502] [2019-12-19 03:45:30,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:45:30,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:45:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:45:30,034 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-19 03:45:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:30,658 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-19 03:45:30,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:45:30,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 03:45:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:30,915 INFO L225 Difference]: With dead ends: 23448 [2019-12-19 03:45:30,916 INFO L226 Difference]: Without dead ends: 21272 [2019-12-19 03:45:30,921 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:45:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-19 03:45:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-19 03:45:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-19 03:45:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-19 03:45:32,982 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-19 03:45:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:32,983 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-19 03:45:32,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:45:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-19 03:45:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:45:32,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:32,998 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:45:32,998 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:45:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash -184333443, now seen corresponding path program 1 times [2019-12-19 03:45:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:32,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066536133] [2019-12-19 03:45:33,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:33,199 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:45:33,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066536133] [2019-12-19 03:45:33,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:33,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:45:33,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699136519] [2019-12-19 03:45:33,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:45:33,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:45:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:45:33,204 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-19 03:45:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:35,098 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-19 03:45:35,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:45:35,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:45:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:35,267 INFO L225 Difference]: With dead ends: 34706 [2019-12-19 03:45:35,267 INFO L226 Difference]: Without dead ends: 34562 [2019-12-19 03:45:35,268 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:45:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-19 03:45:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-19 03:45:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-19 03:45:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-19 03:45:36,769 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-19 03:45:36,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:36,772 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-19 03:45:36,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:45:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-19 03:45:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 03:45:36,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:36,778 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:45:36,778 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:45:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2043575512, now seen corresponding path program 1 times [2019-12-19 03:45:36,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:36,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322941085] [2019-12-19 03:45:36,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:36,913 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:45:36,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322941085] [2019-12-19 03:45:36,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:36,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:45:36,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806750230] [2019-12-19 03:45:36,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:45:36,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:45:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:45:36,916 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-19 03:45:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:37,509 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-19 03:45:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:45:37,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 03:45:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:37,796 INFO L225 Difference]: With dead ends: 40214 [2019-12-19 03:45:37,796 INFO L226 Difference]: Without dead ends: 40054 [2019-12-19 03:45:37,796 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:45:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-19 03:45:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-19 03:45:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-19 03:45:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-19 03:45:40,494 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-19 03:45:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:40,494 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-19 03:45:40,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:45:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-19 03:45:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 03:45:40,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:40,508 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:45:40,509 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:45:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1974753575, now seen corresponding path program 1 times [2019-12-19 03:45:40,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:40,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033122280] [2019-12-19 03:45:40,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:40,597 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:45:40,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033122280] [2019-12-19 03:45:40,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:40,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:45:40,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838628565] [2019-12-19 03:45:40,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:45:40,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:45:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:45:40,599 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-19 03:45:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:41,560 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-19 03:45:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:45:41,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 03:45:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:41,700 INFO L225 Difference]: With dead ends: 45663 [2019-12-19 03:45:41,700 INFO L226 Difference]: Without dead ends: 45519 [2019-12-19 03:45:41,710 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:45:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-19 03:45:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-19 03:45:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-19 03:45:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-19 03:45:44,060 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-19 03:45:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-19 03:45:44,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:45:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-19 03:45:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:45:44,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:44,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:45:44,094 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:45:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 194121141, now seen corresponding path program 1 times [2019-12-19 03:45:44,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:44,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461065792] [2019-12-19 03:45:44,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:44,193 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:45:44,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461065792] [2019-12-19 03:45:44,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:44,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:45:44,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405951514] [2019-12-19 03:45:44,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:45:44,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:45:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:45:44,196 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-19 03:45:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:45,153 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-19 03:45:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:45:45,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 03:45:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:45,245 INFO L225 Difference]: With dead ends: 46070 [2019-12-19 03:45:45,245 INFO L226 Difference]: Without dead ends: 45830 [2019-12-19 03:45:45,246 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:45:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-19 03:45:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-19 03:45:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-19 03:45:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-19 03:45:46,526 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-19 03:45:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:46,526 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-19 03:45:46,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:45:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-19 03:45:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 03:45:46,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:46,558 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:45:46,560 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:45:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1160701436, now seen corresponding path program 1 times [2019-12-19 03:45:46,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511966768] [2019-12-19 03:45:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:46,612 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:45:46,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511966768] [2019-12-19 03:45:46,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:46,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:45:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310194455] [2019-12-19 03:45:46,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:45:46,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:46,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:45:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:45:46,615 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-19 03:45:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:46,853 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-19 03:45:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:45:46,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-19 03:45:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:46,960 INFO L225 Difference]: With dead ends: 50257 [2019-12-19 03:45:46,960 INFO L226 Difference]: Without dead ends: 50257 [2019-12-19 03:45:46,960 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:45:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-19 03:45:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-19 03:45:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-19 03:45:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-19 03:45:49,633 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-19 03:45:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:49,633 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-19 03:45:49,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:45:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-19 03:45:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 03:45:49,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:49,667 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:45:49,668 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:45:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1771534722, now seen corresponding path program 1 times [2019-12-19 03:45:49,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:49,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495978956] [2019-12-19 03:45:49,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:45:49,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495978956] [2019-12-19 03:45:49,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:49,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:45:49,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486651107] [2019-12-19 03:45:49,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:45:49,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:45:49,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:45:49,772 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-19 03:45:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:51,251 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-19 03:45:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:45:51,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 03:45:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:51,377 INFO L225 Difference]: With dead ends: 55885 [2019-12-19 03:45:51,378 INFO L226 Difference]: Without dead ends: 55645 [2019-12-19 03:45:51,378 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:45:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-19 03:45:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-19 03:45:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-19 03:45:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-19 03:45:54,268 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-19 03:45:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:54,269 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-19 03:45:54,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:45:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-19 03:45:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:45:54,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:54,303 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:45:54,303 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:45:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -93886554, now seen corresponding path program 1 times [2019-12-19 03:45:54,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:54,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705333611] [2019-12-19 03:45:54,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:54,411 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:45:54,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705333611] [2019-12-19 03:45:54,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:54,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:45:54,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109129171] [2019-12-19 03:45:54,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:45:54,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:54,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:45:54,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:45:54,413 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-19 03:45:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:55,581 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-19 03:45:55,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:45:55,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 03:45:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:55,696 INFO L225 Difference]: With dead ends: 55099 [2019-12-19 03:45:55,696 INFO L226 Difference]: Without dead ends: 54899 [2019-12-19 03:45:55,696 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:45:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-19 03:45:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-19 03:45:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-19 03:45:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-19 03:45:56,920 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-19 03:45:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:45:56,921 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-19 03:45:56,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:45:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-19 03:45:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:45:56,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:45:56,954 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:45:56,955 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:45:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:45:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 796822408, now seen corresponding path program 1 times [2019-12-19 03:45:56,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:45:56,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132127058] [2019-12-19 03:45:56,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:45:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:45:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:45:57,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132127058] [2019-12-19 03:45:57,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:45:57,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:45:57,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215538351] [2019-12-19 03:45:57,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:45:57,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:45:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:45:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:45:57,071 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-19 03:45:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:45:58,360 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-19 03:45:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:45:58,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 03:45:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:45:58,492 INFO L225 Difference]: With dead ends: 65553 [2019-12-19 03:45:58,492 INFO L226 Difference]: Without dead ends: 64909 [2019-12-19 03:45:58,493 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:45:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-19 03:45:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-19 03:45:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-19 03:46:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-19 03:46:02,574 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-19 03:46:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:02,574 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-19 03:46:02,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:46:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-19 03:46:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:46:02,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:02,636 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:46:02,637 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:46:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1758436425, now seen corresponding path program 1 times [2019-12-19 03:46:02,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:02,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55075973] [2019-12-19 03:46:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:46:02,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55075973] [2019-12-19 03:46:02,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:02,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:46:02,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112418207] [2019-12-19 03:46:02,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:46:02,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:46:02,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:02,758 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-19 03:46:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:03,907 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-19 03:46:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:46:03,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 03:46:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:04,090 INFO L225 Difference]: With dead ends: 83031 [2019-12-19 03:46:04,091 INFO L226 Difference]: Without dead ends: 83031 [2019-12-19 03:46:04,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:46:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-19 03:46:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-19 03:46:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-19 03:46:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-19 03:46:05,799 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-19 03:46:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:05,799 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-19 03:46:05,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:46:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-19 03:46:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 03:46:05,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:05,874 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:46:05,874 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:46:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1291766390, now seen corresponding path program 1 times [2019-12-19 03:46:05,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:05,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433583832] [2019-12-19 03:46:05,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:05,931 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:46:05,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433583832] [2019-12-19 03:46:05,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:05,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:46:05,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705703756] [2019-12-19 03:46:05,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:46:05,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:05,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:46:05,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:46:05,934 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-19 03:46:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:06,219 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-19 03:46:06,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:46:06,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 03:46:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:06,332 INFO L225 Difference]: With dead ends: 54416 [2019-12-19 03:46:06,333 INFO L226 Difference]: Without dead ends: 54254 [2019-12-19 03:46:06,333 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:46:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-19 03:46:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-19 03:46:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-19 03:46:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-19 03:46:07,912 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-19 03:46:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:07,912 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-19 03:46:07,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:46:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-19 03:46:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 03:46:07,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:07,948 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:46:07,948 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:46:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:07,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1538482368, now seen corresponding path program 1 times [2019-12-19 03:46:07,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:07,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431289201] [2019-12-19 03:46:07,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:08,040 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:46:08,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431289201] [2019-12-19 03:46:08,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:08,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:46:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154100403] [2019-12-19 03:46:08,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:46:08,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:08,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:46:08,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:08,042 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 5 states. [2019-12-19 03:46:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:08,830 INFO L93 Difference]: Finished difference Result 84429 states and 303657 transitions. [2019-12-19 03:46:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:46:08,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 03:46:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:09,023 INFO L225 Difference]: With dead ends: 84429 [2019-12-19 03:46:09,023 INFO L226 Difference]: Without dead ends: 84233 [2019-12-19 03:46:09,024 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:46:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84233 states. [2019-12-19 03:46:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84233 to 76148. [2019-12-19 03:46:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76148 states. [2019-12-19 03:46:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76148 states to 76148 states and 275545 transitions. [2019-12-19 03:46:11,038 INFO L78 Accepts]: Start accepts. Automaton has 76148 states and 275545 transitions. Word has length 71 [2019-12-19 03:46:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:11,039 INFO L462 AbstractCegarLoop]: Abstraction has 76148 states and 275545 transitions. [2019-12-19 03:46:11,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:46:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 76148 states and 275545 transitions. [2019-12-19 03:46:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 03:46:11,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:11,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:11,093 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:46:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -293717887, now seen corresponding path program 1 times [2019-12-19 03:46:11,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:11,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900436179] [2019-12-19 03:46:11,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:11,179 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:46:11,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900436179] [2019-12-19 03:46:11,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:11,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:46:11,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069122898] [2019-12-19 03:46:11,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:46:11,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:46:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:11,181 INFO L87 Difference]: Start difference. First operand 76148 states and 275545 transitions. Second operand 5 states. [2019-12-19 03:46:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:11,768 INFO L93 Difference]: Finished difference Result 19616 states and 62266 transitions. [2019-12-19 03:46:11,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:46:11,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 03:46:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:11,809 INFO L225 Difference]: With dead ends: 19616 [2019-12-19 03:46:11,810 INFO L226 Difference]: Without dead ends: 19138 [2019-12-19 03:46:11,810 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:46:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-19 03:46:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-19 03:46:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-19 03:46:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60761 transitions. [2019-12-19 03:46:12,068 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60761 transitions. Word has length 71 [2019-12-19 03:46:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:12,068 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60761 transitions. [2019-12-19 03:46:12,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:46:12,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60761 transitions. [2019-12-19 03:46:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 03:46:12,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:12,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:12,088 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:46:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1162099754, now seen corresponding path program 1 times [2019-12-19 03:46:12,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:12,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769316330] [2019-12-19 03:46:12,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:12,136 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:46:12,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769316330] [2019-12-19 03:46:12,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:12,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:46:12,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356320299] [2019-12-19 03:46:12,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:46:12,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:46:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:46:12,138 INFO L87 Difference]: Start difference. First operand 19126 states and 60761 transitions. Second operand 4 states. [2019-12-19 03:46:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:12,381 INFO L93 Difference]: Finished difference Result 24076 states and 75429 transitions. [2019-12-19 03:46:12,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:46:12,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 03:46:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:12,416 INFO L225 Difference]: With dead ends: 24076 [2019-12-19 03:46:12,416 INFO L226 Difference]: Without dead ends: 24076 [2019-12-19 03:46:12,417 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:46:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-12-19 03:46:12,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 19966. [2019-12-19 03:46:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-19 03:46:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 63128 transitions. [2019-12-19 03:46:12,685 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 63128 transitions. Word has length 80 [2019-12-19 03:46:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:12,685 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 63128 transitions. [2019-12-19 03:46:12,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:46:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 63128 transitions. [2019-12-19 03:46:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 03:46:12,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:12,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:12,700 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:46:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash 907363209, now seen corresponding path program 1 times [2019-12-19 03:46:12,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:12,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578872114] [2019-12-19 03:46:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:46:12,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578872114] [2019-12-19 03:46:12,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:12,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:46:12,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934882759] [2019-12-19 03:46:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:46:12,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:46:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:46:12,787 INFO L87 Difference]: Start difference. First operand 19966 states and 63128 transitions. Second operand 8 states. [2019-12-19 03:46:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:13,674 INFO L93 Difference]: Finished difference Result 22072 states and 69320 transitions. [2019-12-19 03:46:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 03:46:13,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 03:46:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:13,706 INFO L225 Difference]: With dead ends: 22072 [2019-12-19 03:46:13,706 INFO L226 Difference]: Without dead ends: 22024 [2019-12-19 03:46:13,707 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:46:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-19 03:46:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19438. [2019-12-19 03:46:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19438 states. [2019-12-19 03:46:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19438 states to 19438 states and 61630 transitions. [2019-12-19 03:46:13,969 INFO L78 Accepts]: Start accepts. Automaton has 19438 states and 61630 transitions. Word has length 80 [2019-12-19 03:46:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:13,969 INFO L462 AbstractCegarLoop]: Abstraction has 19438 states and 61630 transitions. [2019-12-19 03:46:13,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:46:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19438 states and 61630 transitions. [2019-12-19 03:46:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:46:13,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:13,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:13,987 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:46:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1999994915, now seen corresponding path program 1 times [2019-12-19 03:46:13,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:13,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376395792] [2019-12-19 03:46:13,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:14,093 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:46:14,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376395792] [2019-12-19 03:46:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:14,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:46:14,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255252376] [2019-12-19 03:46:14,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:46:14,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:14,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:46:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:46:14,096 INFO L87 Difference]: Start difference. First operand 19438 states and 61630 transitions. Second operand 8 states. [2019-12-19 03:46:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:16,752 INFO L93 Difference]: Finished difference Result 50432 states and 153648 transitions. [2019-12-19 03:46:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 03:46:16,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-19 03:46:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:16,830 INFO L225 Difference]: With dead ends: 50432 [2019-12-19 03:46:16,831 INFO L226 Difference]: Without dead ends: 49733 [2019-12-19 03:46:16,831 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:46:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49733 states. [2019-12-19 03:46:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49733 to 29966. [2019-12-19 03:46:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-19 03:46:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93560 transitions. [2019-12-19 03:46:17,383 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93560 transitions. Word has length 83 [2019-12-19 03:46:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:17,384 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93560 transitions. [2019-12-19 03:46:17,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:46:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93560 transitions. [2019-12-19 03:46:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:46:17,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:17,417 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:46:17,418 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:46:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1038380898, now seen corresponding path program 1 times [2019-12-19 03:46:17,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:17,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924357870] [2019-12-19 03:46:17,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:17,538 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:46:17,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924357870] [2019-12-19 03:46:17,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:17,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:46:17,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984207651] [2019-12-19 03:46:17,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:46:17,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:46:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:46:17,541 INFO L87 Difference]: Start difference. First operand 29966 states and 93560 transitions. Second operand 6 states. [2019-12-19 03:46:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:18,118 INFO L93 Difference]: Finished difference Result 31404 states and 97497 transitions. [2019-12-19 03:46:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:46:18,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-19 03:46:18,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:18,164 INFO L225 Difference]: With dead ends: 31404 [2019-12-19 03:46:18,164 INFO L226 Difference]: Without dead ends: 31404 [2019-12-19 03:46:18,164 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:46:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-19 03:46:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 29635. [2019-12-19 03:46:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-19 03:46:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 92403 transitions. [2019-12-19 03:46:18,866 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 92403 transitions. Word has length 83 [2019-12-19 03:46:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:18,866 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 92403 transitions. [2019-12-19 03:46:18,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:46:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 92403 transitions. [2019-12-19 03:46:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:46:18,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:18,892 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:46:18,892 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:46:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1320926111, now seen corresponding path program 1 times [2019-12-19 03:46:18,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:18,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095110109] [2019-12-19 03:46:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:19,004 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:46:19,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095110109] [2019-12-19 03:46:19,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:19,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:46:19,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349528413] [2019-12-19 03:46:19,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:46:19,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:19,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:46:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:19,011 INFO L87 Difference]: Start difference. First operand 29635 states and 92403 transitions. Second operand 7 states. [2019-12-19 03:46:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:19,575 INFO L93 Difference]: Finished difference Result 31149 states and 96559 transitions. [2019-12-19 03:46:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:46:19,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-19 03:46:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:19,622 INFO L225 Difference]: With dead ends: 31149 [2019-12-19 03:46:19,622 INFO L226 Difference]: Without dead ends: 31149 [2019-12-19 03:46:19,622 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:46:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2019-12-19 03:46:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 29967. [2019-12-19 03:46:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-19 03:46:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 93234 transitions. [2019-12-19 03:46:20,021 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 93234 transitions. Word has length 83 [2019-12-19 03:46:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:20,021 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 93234 transitions. [2019-12-19 03:46:20,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:46:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 93234 transitions. [2019-12-19 03:46:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-19 03:46:20,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:20,052 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:46:20,052 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:46:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1650691872, now seen corresponding path program 1 times [2019-12-19 03:46:20,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962939152] [2019-12-19 03:46:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:20,093 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:46:20,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962939152] [2019-12-19 03:46:20,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:20,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:46:20,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393704842] [2019-12-19 03:46:20,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:46:20,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:46:20,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:46:20,097 INFO L87 Difference]: Start difference. First operand 29967 states and 93234 transitions. Second operand 3 states. [2019-12-19 03:46:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:20,198 INFO L93 Difference]: Finished difference Result 21488 states and 66271 transitions. [2019-12-19 03:46:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:46:20,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-19 03:46:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:20,235 INFO L225 Difference]: With dead ends: 21488 [2019-12-19 03:46:20,235 INFO L226 Difference]: Without dead ends: 21488 [2019-12-19 03:46:20,235 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:46:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21488 states. [2019-12-19 03:46:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21488 to 21165. [2019-12-19 03:46:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21165 states. [2019-12-19 03:46:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21165 states to 21165 states and 65322 transitions. [2019-12-19 03:46:20,517 INFO L78 Accepts]: Start accepts. Automaton has 21165 states and 65322 transitions. Word has length 83 [2019-12-19 03:46:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:20,517 INFO L462 AbstractCegarLoop]: Abstraction has 21165 states and 65322 transitions. [2019-12-19 03:46:20,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:46:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 21165 states and 65322 transitions. [2019-12-19 03:46:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 03:46:20,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:20,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:20,539 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:46:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash -94516755, now seen corresponding path program 1 times [2019-12-19 03:46:20,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:20,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099876687] [2019-12-19 03:46:20,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:20,615 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:46:20,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099876687] [2019-12-19 03:46:20,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:20,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:46:20,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502620355] [2019-12-19 03:46:20,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:46:20,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:20,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:46:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:46:20,617 INFO L87 Difference]: Start difference. First operand 21165 states and 65322 transitions. Second operand 6 states. [2019-12-19 03:46:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:21,115 INFO L93 Difference]: Finished difference Result 37345 states and 115065 transitions. [2019-12-19 03:46:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:46:21,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-19 03:46:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:21,210 INFO L225 Difference]: With dead ends: 37345 [2019-12-19 03:46:21,211 INFO L226 Difference]: Without dead ends: 37345 [2019-12-19 03:46:21,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:46:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37345 states. [2019-12-19 03:46:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37345 to 23235. [2019-12-19 03:46:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23235 states. [2019-12-19 03:46:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23235 states to 23235 states and 71276 transitions. [2019-12-19 03:46:22,413 INFO L78 Accepts]: Start accepts. Automaton has 23235 states and 71276 transitions. Word has length 84 [2019-12-19 03:46:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:22,414 INFO L462 AbstractCegarLoop]: Abstraction has 23235 states and 71276 transitions. [2019-12-19 03:46:22,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:46:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23235 states and 71276 transitions. [2019-12-19 03:46:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-19 03:46:22,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:22,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:22,442 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:46:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash 235249006, now seen corresponding path program 1 times [2019-12-19 03:46:22,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:22,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193999830] [2019-12-19 03:46:22,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:22,537 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:46:22,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193999830] [2019-12-19 03:46:22,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:22,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:46:22,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535955346] [2019-12-19 03:46:22,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:46:22,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:46:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:22,543 INFO L87 Difference]: Start difference. First operand 23235 states and 71276 transitions. Second operand 5 states. [2019-12-19 03:46:22,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:22,597 INFO L93 Difference]: Finished difference Result 3105 states and 7663 transitions. [2019-12-19 03:46:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:46:22,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-19 03:46:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:22,602 INFO L225 Difference]: With dead ends: 3105 [2019-12-19 03:46:22,602 INFO L226 Difference]: Without dead ends: 2719 [2019-12-19 03:46:22,603 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:46:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2019-12-19 03:46:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2567. [2019-12-19 03:46:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2019-12-19 03:46:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 6343 transitions. [2019-12-19 03:46:22,648 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 6343 transitions. Word has length 84 [2019-12-19 03:46:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:22,648 INFO L462 AbstractCegarLoop]: Abstraction has 2567 states and 6343 transitions. [2019-12-19 03:46:22,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:46:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 6343 transitions. [2019-12-19 03:46:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:22,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:22,656 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:46:22,656 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:46:22,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash 38851860, now seen corresponding path program 1 times [2019-12-19 03:46:22,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:22,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321890189] [2019-12-19 03:46:22,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:22,813 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:46:22,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321890189] [2019-12-19 03:46:22,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:22,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:46:22,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435809815] [2019-12-19 03:46:22,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:46:22,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:22,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:46:22,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:22,816 INFO L87 Difference]: Start difference. First operand 2567 states and 6343 transitions. Second operand 7 states. [2019-12-19 03:46:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:23,021 INFO L93 Difference]: Finished difference Result 2536 states and 6278 transitions. [2019-12-19 03:46:23,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:46:23,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 03:46:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:23,027 INFO L225 Difference]: With dead ends: 2536 [2019-12-19 03:46:23,027 INFO L226 Difference]: Without dead ends: 2536 [2019-12-19 03:46:23,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:46:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2019-12-19 03:46:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2447. [2019-12-19 03:46:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-19 03:46:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 6055 transitions. [2019-12-19 03:46:23,076 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 6055 transitions. Word has length 97 [2019-12-19 03:46:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 6055 transitions. [2019-12-19 03:46:23,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:46:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 6055 transitions. [2019-12-19 03:46:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:23,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:23,080 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:46:23,081 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:46:23,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1880536410, now seen corresponding path program 1 times [2019-12-19 03:46:23,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:23,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938853601] [2019-12-19 03:46:23,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:23,186 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:46:23,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938853601] [2019-12-19 03:46:23,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:23,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:46:23,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942535064] [2019-12-19 03:46:23,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:46:23,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:46:23,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:46:23,199 INFO L87 Difference]: Start difference. First operand 2447 states and 6055 transitions. Second operand 4 states. [2019-12-19 03:46:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:23,344 INFO L93 Difference]: Finished difference Result 2811 states and 6866 transitions. [2019-12-19 03:46:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:46:23,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 03:46:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:23,349 INFO L225 Difference]: With dead ends: 2811 [2019-12-19 03:46:23,349 INFO L226 Difference]: Without dead ends: 2811 [2019-12-19 03:46:23,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:46:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2019-12-19 03:46:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2535. [2019-12-19 03:46:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2535 states. [2019-12-19 03:46:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 6251 transitions. [2019-12-19 03:46:23,388 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 6251 transitions. Word has length 97 [2019-12-19 03:46:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:23,388 INFO L462 AbstractCegarLoop]: Abstraction has 2535 states and 6251 transitions. [2019-12-19 03:46:23,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:46:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 6251 transitions. [2019-12-19 03:46:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:23,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:23,392 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:46:23,392 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:46:23,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash 957852827, now seen corresponding path program 1 times [2019-12-19 03:46:23,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:23,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861190605] [2019-12-19 03:46:23,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:23,508 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:46:23,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861190605] [2019-12-19 03:46:23,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:23,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:46:23,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149963583] [2019-12-19 03:46:23,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:46:23,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:46:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:46:23,510 INFO L87 Difference]: Start difference. First operand 2535 states and 6251 transitions. Second operand 6 states. [2019-12-19 03:46:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:23,603 INFO L93 Difference]: Finished difference Result 2773 states and 6672 transitions. [2019-12-19 03:46:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:46:23,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 03:46:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:23,608 INFO L225 Difference]: With dead ends: 2773 [2019-12-19 03:46:23,608 INFO L226 Difference]: Without dead ends: 2725 [2019-12-19 03:46:23,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-12-19 03:46:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2615. [2019-12-19 03:46:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2019-12-19 03:46:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 6361 transitions. [2019-12-19 03:46:23,648 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 6361 transitions. Word has length 97 [2019-12-19 03:46:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:23,648 INFO L462 AbstractCegarLoop]: Abstraction has 2615 states and 6361 transitions. [2019-12-19 03:46:23,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:46:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 6361 transitions. [2019-12-19 03:46:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:23,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:23,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:46:23,652 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:46:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -977807460, now seen corresponding path program 1 times [2019-12-19 03:46:23,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:23,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96052912] [2019-12-19 03:46:23,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:46:23,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96052912] [2019-12-19 03:46:23,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:23,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:46:23,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226236166] [2019-12-19 03:46:23,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:46:23,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:46:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:23,777 INFO L87 Difference]: Start difference. First operand 2615 states and 6361 transitions. Second operand 7 states. [2019-12-19 03:46:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:24,175 INFO L93 Difference]: Finished difference Result 4794 states and 11810 transitions. [2019-12-19 03:46:24,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:46:24,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 03:46:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:24,183 INFO L225 Difference]: With dead ends: 4794 [2019-12-19 03:46:24,183 INFO L226 Difference]: Without dead ends: 4794 [2019-12-19 03:46:24,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:46:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2019-12-19 03:46:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 2747. [2019-12-19 03:46:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2019-12-19 03:46:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 6634 transitions. [2019-12-19 03:46:24,219 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 6634 transitions. Word has length 97 [2019-12-19 03:46:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:24,219 INFO L462 AbstractCegarLoop]: Abstraction has 2747 states and 6634 transitions. [2019-12-19 03:46:24,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:46:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 6634 transitions. [2019-12-19 03:46:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:24,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:24,222 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:46:24,222 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:46:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash -648041699, now seen corresponding path program 1 times [2019-12-19 03:46:24,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:24,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429450324] [2019-12-19 03:46:24,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:24,282 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:46:24,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429450324] [2019-12-19 03:46:24,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:24,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:46:24,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881188704] [2019-12-19 03:46:24,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:46:24,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:46:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:46:24,285 INFO L87 Difference]: Start difference. First operand 2747 states and 6634 transitions. Second operand 4 states. [2019-12-19 03:46:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:24,380 INFO L93 Difference]: Finished difference Result 2171 states and 5110 transitions. [2019-12-19 03:46:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:46:24,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 03:46:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:24,383 INFO L225 Difference]: With dead ends: 2171 [2019-12-19 03:46:24,383 INFO L226 Difference]: Without dead ends: 2171 [2019-12-19 03:46:24,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2019-12-19 03:46:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2108. [2019-12-19 03:46:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2108 states. [2019-12-19 03:46:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 4971 transitions. [2019-12-19 03:46:24,413 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 4971 transitions. Word has length 97 [2019-12-19 03:46:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:24,413 INFO L462 AbstractCegarLoop]: Abstraction has 2108 states and 4971 transitions. [2019-12-19 03:46:24,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:46:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 4971 transitions. [2019-12-19 03:46:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:24,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:24,416 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:46:24,416 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:46:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1353671292, now seen corresponding path program 1 times [2019-12-19 03:46:24,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:24,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900461530] [2019-12-19 03:46:24,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:24,512 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:46:24,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900461530] [2019-12-19 03:46:24,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:24,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:46:24,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290853602] [2019-12-19 03:46:24,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:46:24,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:24,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:46:24,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:24,514 INFO L87 Difference]: Start difference. First operand 2108 states and 4971 transitions. Second operand 5 states. [2019-12-19 03:46:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:24,555 INFO L93 Difference]: Finished difference Result 2938 states and 7087 transitions. [2019-12-19 03:46:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:46:24,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 03:46:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:24,559 INFO L225 Difference]: With dead ends: 2938 [2019-12-19 03:46:24,559 INFO L226 Difference]: Without dead ends: 2938 [2019-12-19 03:46:24,560 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:46:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-12-19 03:46:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1876. [2019-12-19 03:46:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-12-19 03:46:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 4441 transitions. [2019-12-19 03:46:24,594 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 4441 transitions. Word has length 97 [2019-12-19 03:46:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:24,594 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 4441 transitions. [2019-12-19 03:46:24,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:46:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 4441 transitions. [2019-12-19 03:46:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:24,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:24,597 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:46:24,597 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:46:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -159441766, now seen corresponding path program 1 times [2019-12-19 03:46:24,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:24,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509561612] [2019-12-19 03:46:24,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:24,699 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:46:24,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509561612] [2019-12-19 03:46:24,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:24,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:46:24,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762176529] [2019-12-19 03:46:24,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:46:24,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:46:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:46:24,701 INFO L87 Difference]: Start difference. First operand 1876 states and 4441 transitions. Second operand 7 states. [2019-12-19 03:46:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:25,243 INFO L93 Difference]: Finished difference Result 2881 states and 6621 transitions. [2019-12-19 03:46:25,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 03:46:25,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-19 03:46:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:25,247 INFO L225 Difference]: With dead ends: 2881 [2019-12-19 03:46:25,248 INFO L226 Difference]: Without dead ends: 2863 [2019-12-19 03:46:25,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:46:25,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2019-12-19 03:46:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2195. [2019-12-19 03:46:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-19 03:46:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 5163 transitions. [2019-12-19 03:46:25,282 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 5163 transitions. Word has length 97 [2019-12-19 03:46:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:25,283 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 5163 transitions. [2019-12-19 03:46:25,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:46:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 5163 transitions. [2019-12-19 03:46:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:25,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:25,286 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:46:25,286 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:46:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1085322715, now seen corresponding path program 1 times [2019-12-19 03:46:25,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:25,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551570966] [2019-12-19 03:46:25,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:25,375 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:46:25,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551570966] [2019-12-19 03:46:25,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:25,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:46:25,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130580574] [2019-12-19 03:46:25,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:46:25,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:46:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:46:25,377 INFO L87 Difference]: Start difference. First operand 2195 states and 5163 transitions. Second operand 6 states. [2019-12-19 03:46:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:25,565 INFO L93 Difference]: Finished difference Result 2027 states and 4712 transitions. [2019-12-19 03:46:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:46:25,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-19 03:46:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:25,569 INFO L225 Difference]: With dead ends: 2027 [2019-12-19 03:46:25,569 INFO L226 Difference]: Without dead ends: 2027 [2019-12-19 03:46:25,569 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:46:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-19 03:46:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1912. [2019-12-19 03:46:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-12-19 03:46:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 4493 transitions. [2019-12-19 03:46:25,588 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 4493 transitions. Word has length 97 [2019-12-19 03:46:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:25,588 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 4493 transitions. [2019-12-19 03:46:25,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:46:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 4493 transitions. [2019-12-19 03:46:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:25,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:25,590 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:46:25,590 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:46:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 170323995, now seen corresponding path program 1 times [2019-12-19 03:46:25,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:25,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522962666] [2019-12-19 03:46:25,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:25,685 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:46:25,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522962666] [2019-12-19 03:46:25,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:25,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:46:25,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124328981] [2019-12-19 03:46:25,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:46:25,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:46:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:46:25,687 INFO L87 Difference]: Start difference. First operand 1912 states and 4493 transitions. Second operand 5 states. [2019-12-19 03:46:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:25,879 INFO L93 Difference]: Finished difference Result 2164 states and 5072 transitions. [2019-12-19 03:46:25,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:46:25,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 03:46:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:25,883 INFO L225 Difference]: With dead ends: 2164 [2019-12-19 03:46:25,883 INFO L226 Difference]: Without dead ends: 2146 [2019-12-19 03:46:25,883 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:46:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2019-12-19 03:46:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 1939. [2019-12-19 03:46:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-19 03:46:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4547 transitions. [2019-12-19 03:46:25,910 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4547 transitions. Word has length 97 [2019-12-19 03:46:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:25,910 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4547 transitions. [2019-12-19 03:46:25,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:46:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4547 transitions. [2019-12-19 03:46:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:25,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:25,912 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:46:25,912 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:46:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1415088476, now seen corresponding path program 1 times [2019-12-19 03:46:25,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:25,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164931988] [2019-12-19 03:46:25,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:46:26,075 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:46:26,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164931988] [2019-12-19 03:46:26,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:46:26,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:46:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550895644] [2019-12-19 03:46:26,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:46:26,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:46:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:46:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:46:26,077 INFO L87 Difference]: Start difference. First operand 1939 states and 4547 transitions. Second operand 8 states. [2019-12-19 03:46:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:46:26,209 INFO L93 Difference]: Finished difference Result 3285 states and 7781 transitions. [2019-12-19 03:46:26,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:46:26,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-19 03:46:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:46:26,212 INFO L225 Difference]: With dead ends: 3285 [2019-12-19 03:46:26,212 INFO L226 Difference]: Without dead ends: 1428 [2019-12-19 03:46:26,212 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:46:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-19 03:46:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1348. [2019-12-19 03:46:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-19 03:46:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3203 transitions. [2019-12-19 03:46:26,231 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 3203 transitions. Word has length 97 [2019-12-19 03:46:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:46:26,231 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 3203 transitions. [2019-12-19 03:46:26,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:46:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 3203 transitions. [2019-12-19 03:46:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 03:46:26,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:46:26,233 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:46:26,234 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:46:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:46:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash -466492236, now seen corresponding path program 2 times [2019-12-19 03:46:26,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:46:26,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316026197] [2019-12-19 03:46:26,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:46:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:46:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:46:26,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:46:26,318 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:46:26,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:46:26 BasicIcfg [2019-12-19 03:46:26,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:46:26,481 INFO L168 Benchmark]: Toolchain (without parser) took 60162.98 ms. Allocated memory was 144.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.9 MB in the beginning and 1.1 GB in the end (delta: -965.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,482 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.91 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 156.2 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.34 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,483 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,483 INFO L168 Benchmark]: RCFGBuilder took 767.96 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 106.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,484 INFO L168 Benchmark]: TraceAbstraction took 58463.15 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.4 MB in the beginning and 1.1 GB in the end (delta: -961.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 03:46:26,486 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.91 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 156.2 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.34 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 152.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.31 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.96 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 106.0 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58463.15 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.4 MB in the beginning and 1.1 GB in the end (delta: -961.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [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 t1613; 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(&t1613, ((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 t1614; 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(&t1614, ((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: 58.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8246 SDtfs, 9182 SDslu, 20262 SDs, 0 SdLazy, 9059 SolverSat, 575 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 87 SyntacticMatches, 23 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 2.5s 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: 30.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 123185 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2396 ConstructedInterpolants, 0 QuantifiedInterpolants, 494916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...