/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/rfi004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:50:20,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:50:20,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:50:20,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:50:20,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:50:20,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:50:20,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:50:20,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:50:20,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:50:20,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:50:20,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:50:20,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:50:20,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:50:20,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:50:20,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:50:20,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:50:20,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:50:20,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:50:20,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:50:20,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:50:20,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:50:20,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:50:20,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:50:20,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:50:20,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:50:20,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:50:20,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:50:20,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:50:20,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:50:20,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:50:20,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:50:20,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:50:20,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:50:20,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:50:20,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:50:20,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:50:20,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:50:20,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:50:20,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:50:20,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:50:20,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:50:20,103 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:50:20,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:50:20,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:50:20,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:50:20,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:50:20,126 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:50:20,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:50:20,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:50:20,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:50:20,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:50:20,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:50:20,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:50:20,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:50:20,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:50:20,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:50:20,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:50:20,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:50:20,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:50:20,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:50:20,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:50:20,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:50:20,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:50:20,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:50:20,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:50:20,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:50:20,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:50:20,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:50:20,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:50:20,132 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:50:20,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:50:20,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:50:20,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:50:20,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:50:20,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:50:20,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:50:20,421 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:50:20,422 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-19 03:50:20,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110770266/17a20ffdffa549108dd28676b3d8babd/FLAG0098744ab [2019-12-19 03:50:21,059 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:50:21,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-19 03:50:21,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110770266/17a20ffdffa549108dd28676b3d8babd/FLAG0098744ab [2019-12-19 03:50:21,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110770266/17a20ffdffa549108dd28676b3d8babd [2019-12-19 03:50:21,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:50:21,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:50:21,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:50:21,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:50:21,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:50:21,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:50:21" (1/1) ... [2019-12-19 03:50:21,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:21, skipping insertion in model container [2019-12-19 03:50:21,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:50:21" (1/1) ... [2019-12-19 03:50:21,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:50:21,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:50:21,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:50:21,991 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:50:22,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:50:22,121 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:50:22,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22 WrapperNode [2019-12-19 03:50:22,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:50:22,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:50:22,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:50:22,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:50:22,132 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:50:22" (1/1) ... [2019-12-19 03:50:22,154 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:50:22" (1/1) ... [2019-12-19 03:50:22,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:50:22,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:50:22,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:50:22,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:50:22,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (1/1) ... [2019-12-19 03:50:22,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:50:22,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:50:22,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:50:22,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:50:22,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (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:50:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:50:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:50:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:50:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:50:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:50:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:50:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:50:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:50:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:50:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:50:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:50:22,316 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:50:23,006 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:50:23,006 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:50:23,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:50:23 BoogieIcfgContainer [2019-12-19 03:50:23,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:50:23,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:50:23,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:50:23,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:50:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:50:21" (1/3) ... [2019-12-19 03:50:23,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118ad9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:50:23, skipping insertion in model container [2019-12-19 03:50:23,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:50:22" (2/3) ... [2019-12-19 03:50:23,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118ad9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:50:23, skipping insertion in model container [2019-12-19 03:50:23,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:50:23" (3/3) ... [2019-12-19 03:50:23,017 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc.i [2019-12-19 03:50:23,025 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:50:23,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:50:23,033 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:50:23,034 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,095 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,108 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,108 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,115 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:50:23,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:50:23,171 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:50:23,171 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:50:23,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:50:23,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:50:23,172 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:50:23,172 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:50:23,172 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:50:23,172 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:50:23,186 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-19 03:50:24,651 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-19 03:50:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-19 03:50:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-19 03:50:24,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:24,666 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] [2019-12-19 03:50:24,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-19 03:50:24,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:24,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523997819] [2019-12-19 03:50:24,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:25,104 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:50:25,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523997819] [2019-12-19 03:50:25,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:25,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:25,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592751000] [2019-12-19 03:50:25,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:25,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:25,133 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-19 03:50:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:25,943 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-19 03:50:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:50:25,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-19 03:50:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:26,130 INFO L225 Difference]: With dead ends: 26617 [2019-12-19 03:50:26,130 INFO L226 Difference]: Without dead ends: 20361 [2019-12-19 03:50:26,132 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:50:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-19 03:50:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-19 03:50:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-19 03:50:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-19 03:50:27,905 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-19 03:50:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:27,906 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-19 03:50:27,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-19 03:50:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:50:27,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:27,920 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] [2019-12-19 03:50:27,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-19 03:50:27,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:27,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921253425] [2019-12-19 03:50:27,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:28,337 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:50:28,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921253425] [2019-12-19 03:50:28,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:28,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:28,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301864209] [2019-12-19 03:50:28,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:28,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:28,346 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-19 03:50:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:29,220 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-19 03:50:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:29,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 03:50:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:29,365 INFO L225 Difference]: With dead ends: 31839 [2019-12-19 03:50:29,365 INFO L226 Difference]: Without dead ends: 31287 [2019-12-19 03:50:29,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-19 03:50:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-19 03:50:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-19 03:50:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-19 03:50:31,637 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-19 03:50:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:31,639 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-19 03:50:31,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-19 03:50:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:50:31,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:31,647 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] [2019-12-19 03:50:31,647 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-19 03:50:31,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:31,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122084228] [2019-12-19 03:50:31,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:31,717 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:50:31,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122084228] [2019-12-19 03:50:31,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:31,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:31,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118467387] [2019-12-19 03:50:31,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:31,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:31,719 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-19 03:50:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:32,273 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-19 03:50:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:32,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 03:50:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:32,419 INFO L225 Difference]: With dead ends: 38697 [2019-12-19 03:50:32,420 INFO L226 Difference]: Without dead ends: 38249 [2019-12-19 03:50:32,420 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:50:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-19 03:50:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-19 03:50:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-19 03:50:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-19 03:50:35,605 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-19 03:50:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:35,606 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-19 03:50:35,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-19 03:50:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 03:50:35,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:35,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:35,620 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-19 03:50:35,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:35,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763582830] [2019-12-19 03:50:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:35,657 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:50:35,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763582830] [2019-12-19 03:50:35,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:35,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:50:35,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912553358] [2019-12-19 03:50:35,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:50:35,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:35,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:50:35,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:50:35,660 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-19 03:50:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:35,876 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-19 03:50:35,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:50:35,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 03:50:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:36,017 INFO L225 Difference]: With dead ends: 42413 [2019-12-19 03:50:36,018 INFO L226 Difference]: Without dead ends: 42413 [2019-12-19 03:50:36,018 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:50:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-19 03:50:37,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-19 03:50:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-19 03:50:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-19 03:50:37,140 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-19 03:50:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:37,141 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-19 03:50:37,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:50:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-19 03:50:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:37,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:37,157 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] [2019-12-19 03:50:37,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-19 03:50:37,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:37,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612754479] [2019-12-19 03:50:37,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:37,246 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:50:37,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612754479] [2019-12-19 03:50:37,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:37,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:37,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825491987] [2019-12-19 03:50:37,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:37,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:37,248 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 6 states. [2019-12-19 03:50:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:38,228 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-19 03:50:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:50:38,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:50:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:38,334 INFO L225 Difference]: With dead ends: 48757 [2019-12-19 03:50:38,334 INFO L226 Difference]: Without dead ends: 48237 [2019-12-19 03:50:38,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 03:50:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-19 03:50:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-19 03:50:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-19 03:50:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-19 03:50:40,735 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-19 03:50:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:40,736 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-19 03:50:40,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-19 03:50:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:40,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:40,751 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] [2019-12-19 03:50:40,751 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-19 03:50:40,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:40,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761298031] [2019-12-19 03:50:40,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:40,901 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:50:40,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761298031] [2019-12-19 03:50:40,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:40,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:40,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014125906] [2019-12-19 03:50:40,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:40,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:40,904 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-19 03:50:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:41,652 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-19 03:50:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:41,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:50:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:41,772 INFO L225 Difference]: With dead ends: 53006 [2019-12-19 03:50:41,773 INFO L226 Difference]: Without dead ends: 52030 [2019-12-19 03:50:41,773 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:50:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-19 03:50:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-19 03:50:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-19 03:50:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-19 03:50:43,049 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-19 03:50:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:43,050 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-19 03:50:43,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-19 03:50:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:43,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:43,062 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] [2019-12-19 03:50:43,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-19 03:50:43,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:43,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644243832] [2019-12-19 03:50:43,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:43,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:50:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644243832] [2019-12-19 03:50:43,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:43,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:50:43,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229158701] [2019-12-19 03:50:43,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:50:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:50:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:43,190 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-19 03:50:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:45,659 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-19 03:50:45,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:50:45,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 03:50:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:45,811 INFO L225 Difference]: With dead ends: 70898 [2019-12-19 03:50:45,811 INFO L226 Difference]: Without dead ends: 70898 [2019-12-19 03:50:45,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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:50:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-19 03:50:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-19 03:50:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-19 03:50:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-19 03:50:47,158 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-19 03:50:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:47,159 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-19 03:50:47,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:50:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-19 03:50:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:50:47,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:47,174 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] [2019-12-19 03:50:47,174 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-19 03:50:47,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:47,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930073961] [2019-12-19 03:50:47,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:47,254 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:50:47,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930073961] [2019-12-19 03:50:47,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:47,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:50:47,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747513312] [2019-12-19 03:50:47,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:50:47,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:50:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:50:47,256 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-12-19 03:50:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:47,514 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-12-19 03:50:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:50:47,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-19 03:50:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:47,648 INFO L225 Difference]: With dead ends: 43857 [2019-12-19 03:50:47,649 INFO L226 Difference]: Without dead ends: 43353 [2019-12-19 03:50:47,649 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:50:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-12-19 03:50:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-12-19 03:50:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-12-19 03:50:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-12-19 03:50:49,015 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-12-19 03:50:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:49,015 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-12-19 03:50:49,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:50:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-12-19 03:50:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 03:50:49,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:49,026 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] [2019-12-19 03:50:49,026 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:49,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:49,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1658901394, now seen corresponding path program 1 times [2019-12-19 03:50:49,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:49,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573895846] [2019-12-19 03:50:49,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:49,131 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:50:49,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573895846] [2019-12-19 03:50:49,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:49,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:49,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217959205] [2019-12-19 03:50:49,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:49,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:49,135 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-12-19 03:50:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:49,984 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-12-19 03:50:49,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:49,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 03:50:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:50,494 INFO L225 Difference]: With dead ends: 54550 [2019-12-19 03:50:50,494 INFO L226 Difference]: Without dead ends: 54550 [2019-12-19 03:50:50,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-12-19 03:50:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-12-19 03:50:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-19 03:50:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-12-19 03:50:51,341 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-12-19 03:50:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:51,341 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-12-19 03:50:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-12-19 03:50:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 03:50:51,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:51,352 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] [2019-12-19 03:50:51,352 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash -771397713, now seen corresponding path program 1 times [2019-12-19 03:50:51,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:51,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449534214] [2019-12-19 03:50:51,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:51,429 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:50:51,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449534214] [2019-12-19 03:50:51,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:51,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:51,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30931663] [2019-12-19 03:50:51,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:51,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:51,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:51,431 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-12-19 03:50:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:51,476 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-12-19 03:50:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:51,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-19 03:50:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:51,486 INFO L225 Difference]: With dead ends: 8164 [2019-12-19 03:50:51,487 INFO L226 Difference]: Without dead ends: 6755 [2019-12-19 03:50:51,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-12-19 03:50:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-12-19 03:50:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-12-19 03:50:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-12-19 03:50:51,572 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-12-19 03:50:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:51,572 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-12-19 03:50:51,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-12-19 03:50:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 03:50:51,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:51,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:51,576 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-19 03:50:51,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:51,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154942062] [2019-12-19 03:50:51,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:51,920 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:50:51,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154942062] [2019-12-19 03:50:51,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:51,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:51,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860916537] [2019-12-19 03:50:51,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:51,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:51,923 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-12-19 03:50:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:52,055 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-12-19 03:50:52,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:52,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 03:50:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:52,067 INFO L225 Difference]: With dead ends: 7892 [2019-12-19 03:50:52,067 INFO L226 Difference]: Without dead ends: 7892 [2019-12-19 03:50:52,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-12-19 03:50:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-12-19 03:50:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-12-19 03:50:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-12-19 03:50:52,192 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-12-19 03:50:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-12-19 03:50:52,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-12-19 03:50:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 03:50:52,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:52,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:50:52,197 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-19 03:50:52,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:52,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76120749] [2019-12-19 03:50:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:50:52,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76120749] [2019-12-19 03:50:52,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:52,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:52,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893101709] [2019-12-19 03:50:52,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:52,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:52,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:52,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:52,257 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-12-19 03:50:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:52,604 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-12-19 03:50:52,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:50:52,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 03:50:52,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:52,618 INFO L225 Difference]: With dead ends: 9269 [2019-12-19 03:50:52,618 INFO L226 Difference]: Without dead ends: 9221 [2019-12-19 03:50:52,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:50:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-19 03:50:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-12-19 03:50:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-12-19 03:50:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-12-19 03:50:52,731 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-12-19 03:50:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:52,731 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-12-19 03:50:52,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-12-19 03:50:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:52,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:52,738 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] [2019-12-19 03:50:52,738 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2066677115, now seen corresponding path program 1 times [2019-12-19 03:50:52,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:52,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968632694] [2019-12-19 03:50:52,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:52,800 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:50:52,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968632694] [2019-12-19 03:50:52,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:52,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:52,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684694208] [2019-12-19 03:50:52,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:52,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:52,802 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-12-19 03:50:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:53,036 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-12-19 03:50:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:50:53,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 03:50:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:53,050 INFO L225 Difference]: With dead ends: 10666 [2019-12-19 03:50:53,050 INFO L226 Difference]: Without dead ends: 10666 [2019-12-19 03:50:53,051 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:50:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-19 03:50:53,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-12-19 03:50:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-12-19 03:50:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-12-19 03:50:53,167 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-12-19 03:50:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:53,167 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-12-19 03:50:53,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-12-19 03:50:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:53,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:53,175 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] [2019-12-19 03:50:53,175 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash -983525700, now seen corresponding path program 1 times [2019-12-19 03:50:53,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:53,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015530846] [2019-12-19 03:50:53,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:53,237 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:50:53,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015530846] [2019-12-19 03:50:53,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:53,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:53,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188057927] [2019-12-19 03:50:53,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:53,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:53,239 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-12-19 03:50:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:53,961 INFO L93 Difference]: Finished difference Result 17149 states and 50035 transitions. [2019-12-19 03:50:53,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:50:53,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 03:50:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:53,994 INFO L225 Difference]: With dead ends: 17149 [2019-12-19 03:50:53,994 INFO L226 Difference]: Without dead ends: 17149 [2019-12-19 03:50:53,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:50:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-19 03:50:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12308. [2019-12-19 03:50:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-19 03:50:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 35903 transitions. [2019-12-19 03:50:54,198 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 35903 transitions. Word has length 69 [2019-12-19 03:50:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:54,198 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 35903 transitions. [2019-12-19 03:50:54,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 35903 transitions. [2019-12-19 03:50:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:54,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:54,211 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] [2019-12-19 03:50:54,211 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1494059877, now seen corresponding path program 1 times [2019-12-19 03:50:54,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:54,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910101819] [2019-12-19 03:50:54,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:54,300 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:50:54,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910101819] [2019-12-19 03:50:54,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:54,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:50:54,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570372442] [2019-12-19 03:50:54,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:50:54,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:54,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:50:54,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:50:54,302 INFO L87 Difference]: Start difference. First operand 12308 states and 35903 transitions. Second operand 7 states. [2019-12-19 03:50:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:55,724 INFO L93 Difference]: Finished difference Result 17995 states and 52090 transitions. [2019-12-19 03:50:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 03:50:55,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 03:50:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:55,749 INFO L225 Difference]: With dead ends: 17995 [2019-12-19 03:50:55,750 INFO L226 Difference]: Without dead ends: 17638 [2019-12-19 03:50:55,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-19 03:50:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-19 03:50:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 15469. [2019-12-19 03:50:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-19 03:50:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 45203 transitions. [2019-12-19 03:50:55,961 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 45203 transitions. Word has length 69 [2019-12-19 03:50:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:55,961 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 45203 transitions. [2019-12-19 03:50:55,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:50:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 45203 transitions. [2019-12-19 03:50:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:55,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:55,973 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] [2019-12-19 03:50:55,973 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1003956060, now seen corresponding path program 1 times [2019-12-19 03:50:55,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:55,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920857400] [2019-12-19 03:50:55,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:56,103 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:50:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920857400] [2019-12-19 03:50:56,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:56,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:50:56,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069177024] [2019-12-19 03:50:56,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:50:56,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:50:56,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:50:56,106 INFO L87 Difference]: Start difference. First operand 15469 states and 45203 transitions. Second operand 6 states. [2019-12-19 03:50:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:56,589 INFO L93 Difference]: Finished difference Result 15470 states and 44822 transitions. [2019-12-19 03:50:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:50:56,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 03:50:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:56,614 INFO L225 Difference]: With dead ends: 15470 [2019-12-19 03:50:56,615 INFO L226 Difference]: Without dead ends: 15470 [2019-12-19 03:50:56,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:50:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-19 03:50:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 15030. [2019-12-19 03:50:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15030 states. [2019-12-19 03:50:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 43684 transitions. [2019-12-19 03:50:56,823 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 43684 transitions. Word has length 69 [2019-12-19 03:50:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:56,823 INFO L462 AbstractCegarLoop]: Abstraction has 15030 states and 43684 transitions. [2019-12-19 03:50:56,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:50:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 43684 transitions. [2019-12-19 03:50:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:56,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:56,834 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] [2019-12-19 03:50:56,834 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1234232253, now seen corresponding path program 1 times [2019-12-19 03:50:56,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:56,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282712248] [2019-12-19 03:50:56,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:56,893 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:50:56,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282712248] [2019-12-19 03:50:56,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:56,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:56,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741828689] [2019-12-19 03:50:56,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:56,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:56,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:56,895 INFO L87 Difference]: Start difference. First operand 15030 states and 43684 transitions. Second operand 5 states. [2019-12-19 03:50:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:57,178 INFO L93 Difference]: Finished difference Result 19011 states and 54959 transitions. [2019-12-19 03:50:57,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:50:57,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:50:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:57,205 INFO L225 Difference]: With dead ends: 19011 [2019-12-19 03:50:57,205 INFO L226 Difference]: Without dead ends: 19011 [2019-12-19 03:50:57,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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:50:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19011 states. [2019-12-19 03:50:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19011 to 16078. [2019-12-19 03:50:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-12-19 03:50:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 46402 transitions. [2019-12-19 03:50:57,416 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 46402 transitions. Word has length 69 [2019-12-19 03:50:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 16078 states and 46402 transitions. [2019-12-19 03:50:57,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:50:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 46402 transitions. [2019-12-19 03:50:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:57,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:57,426 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] [2019-12-19 03:50:57,426 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-19 03:50:57,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:57,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028139163] [2019-12-19 03:50:57,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:57,474 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:50:57,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028139163] [2019-12-19 03:50:57,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:57,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:50:57,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174454189] [2019-12-19 03:50:57,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:50:57,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:50:57,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:50:57,477 INFO L87 Difference]: Start difference. First operand 16078 states and 46402 transitions. Second operand 4 states. [2019-12-19 03:50:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:58,053 INFO L93 Difference]: Finished difference Result 19504 states and 56336 transitions. [2019-12-19 03:50:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:50:58,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 03:50:58,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:58,097 INFO L225 Difference]: With dead ends: 19504 [2019-12-19 03:50:58,097 INFO L226 Difference]: Without dead ends: 19129 [2019-12-19 03:50:58,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2019-12-19 03:50:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 15673. [2019-12-19 03:50:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2019-12-19 03:50:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 45021 transitions. [2019-12-19 03:50:58,433 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 45021 transitions. Word has length 69 [2019-12-19 03:50:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:58,433 INFO L462 AbstractCegarLoop]: Abstraction has 15673 states and 45021 transitions. [2019-12-19 03:50:58,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:50:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 45021 transitions. [2019-12-19 03:50:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:58,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:58,450 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] [2019-12-19 03:50:58,450 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-19 03:50:58,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:58,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608837234] [2019-12-19 03:50:58,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:58,617 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:50:58,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608837234] [2019-12-19 03:50:58,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:58,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 03:50:58,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177294913] [2019-12-19 03:50:58,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 03:50:58,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:58,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 03:50:58,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:50:58,619 INFO L87 Difference]: Start difference. First operand 15673 states and 45021 transitions. Second operand 9 states. [2019-12-19 03:50:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:50:59,608 INFO L93 Difference]: Finished difference Result 21380 states and 60901 transitions. [2019-12-19 03:50:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:50:59,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-19 03:50:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:50:59,639 INFO L225 Difference]: With dead ends: 21380 [2019-12-19 03:50:59,639 INFO L226 Difference]: Without dead ends: 21380 [2019-12-19 03:50:59,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:50:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21380 states. [2019-12-19 03:50:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21380 to 18260. [2019-12-19 03:50:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18260 states. [2019-12-19 03:50:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18260 states to 18260 states and 52131 transitions. [2019-12-19 03:50:59,893 INFO L78 Accepts]: Start accepts. Automaton has 18260 states and 52131 transitions. Word has length 69 [2019-12-19 03:50:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:50:59,894 INFO L462 AbstractCegarLoop]: Abstraction has 18260 states and 52131 transitions. [2019-12-19 03:50:59,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 03:50:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18260 states and 52131 transitions. [2019-12-19 03:50:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:50:59,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:50:59,910 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] [2019-12-19 03:50:59,910 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:50:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:50:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash -185749602, now seen corresponding path program 1 times [2019-12-19 03:50:59,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:50:59,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579577742] [2019-12-19 03:50:59,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:50:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:50:59,985 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:50:59,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579577742] [2019-12-19 03:50:59,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:50:59,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:50:59,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326808615] [2019-12-19 03:50:59,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:50:59,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:50:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:50:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:50:59,987 INFO L87 Difference]: Start difference. First operand 18260 states and 52131 transitions. Second operand 5 states. [2019-12-19 03:51:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:00,037 INFO L93 Difference]: Finished difference Result 6131 states and 15110 transitions. [2019-12-19 03:51:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:51:00,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:51:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:00,044 INFO L225 Difference]: With dead ends: 6131 [2019-12-19 03:51:00,044 INFO L226 Difference]: Without dead ends: 5106 [2019-12-19 03:51:00,045 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:51:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2019-12-19 03:51:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 4107. [2019-12-19 03:51:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4107 states. [2019-12-19 03:51:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 10023 transitions. [2019-12-19 03:51:00,090 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 10023 transitions. Word has length 69 [2019-12-19 03:51:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:00,090 INFO L462 AbstractCegarLoop]: Abstraction has 4107 states and 10023 transitions. [2019-12-19 03:51:00,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 10023 transitions. [2019-12-19 03:51:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:00,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:00,096 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] [2019-12-19 03:51:00,096 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1417025587, now seen corresponding path program 1 times [2019-12-19 03:51:00,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:00,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141522622] [2019-12-19 03:51:00,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:00,209 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:51:00,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141522622] [2019-12-19 03:51:00,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:00,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:00,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107779860] [2019-12-19 03:51:00,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:00,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:00,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:00,212 INFO L87 Difference]: Start difference. First operand 4107 states and 10023 transitions. Second operand 7 states. [2019-12-19 03:51:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:00,933 INFO L93 Difference]: Finished difference Result 5004 states and 11981 transitions. [2019-12-19 03:51:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 03:51:00,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 03:51:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:00,941 INFO L225 Difference]: With dead ends: 5004 [2019-12-19 03:51:00,941 INFO L226 Difference]: Without dead ends: 4962 [2019-12-19 03:51:00,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:51:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4962 states. [2019-12-19 03:51:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4962 to 4287. [2019-12-19 03:51:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-19 03:51:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 10409 transitions. [2019-12-19 03:51:00,988 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 10409 transitions. Word has length 86 [2019-12-19 03:51:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 10409 transitions. [2019-12-19 03:51:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 10409 transitions. [2019-12-19 03:51:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:00,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:00,993 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] [2019-12-19 03:51:00,994 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1186749394, now seen corresponding path program 1 times [2019-12-19 03:51:00,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:00,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360746251] [2019-12-19 03:51:00,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:01,062 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:51:01,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360746251] [2019-12-19 03:51:01,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:01,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:01,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166025148] [2019-12-19 03:51:01,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:01,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:01,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:01,064 INFO L87 Difference]: Start difference. First operand 4287 states and 10409 transitions. Second operand 6 states. [2019-12-19 03:51:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:01,481 INFO L93 Difference]: Finished difference Result 5282 states and 12642 transitions. [2019-12-19 03:51:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:51:01,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-19 03:51:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:01,488 INFO L225 Difference]: With dead ends: 5282 [2019-12-19 03:51:01,489 INFO L226 Difference]: Without dead ends: 5282 [2019-12-19 03:51:01,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:51:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2019-12-19 03:51:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 4332. [2019-12-19 03:51:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4332 states. [2019-12-19 03:51:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 10507 transitions. [2019-12-19 03:51:01,557 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 10507 transitions. Word has length 86 [2019-12-19 03:51:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:01,558 INFO L462 AbstractCegarLoop]: Abstraction has 4332 states and 10507 transitions. [2019-12-19 03:51:01,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 10507 transitions. [2019-12-19 03:51:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:01,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:01,562 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] [2019-12-19 03:51:01,562 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:01,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 800732366, now seen corresponding path program 1 times [2019-12-19 03:51:01,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:01,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221954090] [2019-12-19 03:51:01,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:01,694 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:51:01,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221954090] [2019-12-19 03:51:01,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:01,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:01,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624220193] [2019-12-19 03:51:01,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:01,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:01,703 INFO L87 Difference]: Start difference. First operand 4332 states and 10507 transitions. Second operand 7 states. [2019-12-19 03:51:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:01,986 INFO L93 Difference]: Finished difference Result 4834 states and 11603 transitions. [2019-12-19 03:51:01,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:51:01,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 03:51:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:01,994 INFO L225 Difference]: With dead ends: 4834 [2019-12-19 03:51:01,995 INFO L226 Difference]: Without dead ends: 4834 [2019-12-19 03:51:01,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:51:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2019-12-19 03:51:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 3290. [2019-12-19 03:51:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3290 states. [2019-12-19 03:51:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 7769 transitions. [2019-12-19 03:51:02,058 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 7769 transitions. Word has length 86 [2019-12-19 03:51:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:02,058 INFO L462 AbstractCegarLoop]: Abstraction has 3290 states and 7769 transitions. [2019-12-19 03:51:02,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 7769 transitions. [2019-12-19 03:51:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:02,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:02,063 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] [2019-12-19 03:51:02,064 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-19 03:51:02,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:02,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158268471] [2019-12-19 03:51:02,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:02,181 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:51:02,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158268471] [2019-12-19 03:51:02,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:02,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:02,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467483733] [2019-12-19 03:51:02,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:02,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:02,184 INFO L87 Difference]: Start difference. First operand 3290 states and 7769 transitions. Second operand 7 states. [2019-12-19 03:51:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:02,309 INFO L93 Difference]: Finished difference Result 5385 states and 12834 transitions. [2019-12-19 03:51:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:02,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 03:51:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:02,317 INFO L225 Difference]: With dead ends: 5385 [2019-12-19 03:51:02,317 INFO L226 Difference]: Without dead ends: 4799 [2019-12-19 03:51:02,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:51:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2019-12-19 03:51:02,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 3200. [2019-12-19 03:51:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2019-12-19 03:51:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 7571 transitions. [2019-12-19 03:51:02,379 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 7571 transitions. Word has length 86 [2019-12-19 03:51:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:02,380 INFO L462 AbstractCegarLoop]: Abstraction has 3200 states and 7571 transitions. [2019-12-19 03:51:02,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 7571 transitions. [2019-12-19 03:51:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:02,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:02,384 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] [2019-12-19 03:51:02,385 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash 766194047, now seen corresponding path program 2 times [2019-12-19 03:51:02,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:02,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384138075] [2019-12-19 03:51:02,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:02,549 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:51:02,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384138075] [2019-12-19 03:51:02,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:02,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:51:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60397061] [2019-12-19 03:51:02,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:51:02,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:02,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:51:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:02,551 INFO L87 Difference]: Start difference. First operand 3200 states and 7571 transitions. Second operand 8 states. [2019-12-19 03:51:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:02,649 INFO L93 Difference]: Finished difference Result 5250 states and 12531 transitions. [2019-12-19 03:51:02,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:02,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-19 03:51:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:02,652 INFO L225 Difference]: With dead ends: 5250 [2019-12-19 03:51:02,652 INFO L226 Difference]: Without dead ends: 2137 [2019-12-19 03:51:02,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:51:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-12-19 03:51:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2019-12-19 03:51:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2019-12-19 03:51:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 5103 transitions. [2019-12-19 03:51:02,681 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 5103 transitions. Word has length 86 [2019-12-19 03:51:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:02,682 INFO L462 AbstractCegarLoop]: Abstraction has 2137 states and 5103 transitions. [2019-12-19 03:51:02,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:51:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 5103 transitions. [2019-12-19 03:51:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:02,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:02,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:02,685 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 644452468, now seen corresponding path program 2 times [2019-12-19 03:51:02,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:02,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839349713] [2019-12-19 03:51:02,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:02,868 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:51:02,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839349713] [2019-12-19 03:51:02,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:02,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 03:51:02,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114203483] [2019-12-19 03:51:02,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 03:51:02,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 03:51:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:51:02,872 INFO L87 Difference]: Start difference. First operand 2137 states and 5103 transitions. Second operand 11 states. [2019-12-19 03:51:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:03,709 INFO L93 Difference]: Finished difference Result 2930 states and 6837 transitions. [2019-12-19 03:51:03,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:51:03,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-19 03:51:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:03,715 INFO L225 Difference]: With dead ends: 2930 [2019-12-19 03:51:03,715 INFO L226 Difference]: Without dead ends: 2930 [2019-12-19 03:51:03,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-19 03:51:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-12-19 03:51:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2176. [2019-12-19 03:51:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-12-19 03:51:03,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 5176 transitions. [2019-12-19 03:51:03,761 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 5176 transitions. Word has length 86 [2019-12-19 03:51:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:03,761 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 5176 transitions. [2019-12-19 03:51:03,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 03:51:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 5176 transitions. [2019-12-19 03:51:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:03,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:03,766 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] [2019-12-19 03:51:03,766 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 3 times [2019-12-19 03:51:03,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:03,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104958864] [2019-12-19 03:51:03,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:03,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104958864] [2019-12-19 03:51:03,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:03,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:51:03,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66586590] [2019-12-19 03:51:03,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:51:03,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:51:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:51:03,883 INFO L87 Difference]: Start difference. First operand 2176 states and 5176 transitions. Second operand 10 states. [2019-12-19 03:51:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:04,168 INFO L93 Difference]: Finished difference Result 3820 states and 8966 transitions. [2019-12-19 03:51:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 03:51:04,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-19 03:51:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:04,172 INFO L225 Difference]: With dead ends: 3820 [2019-12-19 03:51:04,173 INFO L226 Difference]: Without dead ends: 2486 [2019-12-19 03:51:04,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-19 03:51:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-12-19 03:51:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2243. [2019-12-19 03:51:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-12-19 03:51:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 5270 transitions. [2019-12-19 03:51:04,194 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 5270 transitions. Word has length 86 [2019-12-19 03:51:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:04,194 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 5270 transitions. [2019-12-19 03:51:04,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:51:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 5270 transitions. [2019-12-19 03:51:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:04,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:04,197 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] [2019-12-19 03:51:04,197 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 4 times [2019-12-19 03:51:04,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:04,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275355044] [2019-12-19 03:51:04,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:51:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:51:04,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:51:04,285 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:51:04,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:51:04 BasicIcfg [2019-12-19 03:51:04,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:51:04,482 INFO L168 Benchmark]: Toolchain (without parser) took 43099.52 ms. Allocated memory was 146.8 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 102.0 MB in the beginning and 866.0 MB in the end (delta: -764.0 MB). Peak memory consumption was 999.2 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,482 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.71 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 159.4 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 204.5 MB. Free memory was 159.4 MB in the beginning and 156.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,484 INFO L168 Benchmark]: Boogie Preprocessor took 35.68 ms. Allocated memory is still 204.5 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,484 INFO L168 Benchmark]: RCFGBuilder took 780.67 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 113.4 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,485 INFO L168 Benchmark]: TraceAbstraction took 41470.60 ms. Allocated memory was 204.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 112.8 MB in the beginning and 866.0 MB in the end (delta: -753.2 MB). Peak memory consumption was 952.3 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:04,487 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.22 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.71 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 159.4 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.54 ms. Allocated memory is still 204.5 MB. Free memory was 159.4 MB in the beginning and 156.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.68 ms. Allocated memory is still 204.5 MB. Free memory was 156.8 MB in the beginning and 154.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.67 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 113.4 MB in the end (delta: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41470.60 ms. Allocated memory was 204.5 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 112.8 MB in the beginning and 866.0 MB in the end (delta: -753.2 MB). Peak memory consumption was 952.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L801] 0 pthread_t t1649; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L802] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L803] 0 pthread_t t1650; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L804] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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_p0_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 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=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 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 [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 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 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=1, 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, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7384 SDtfs, 8905 SDslu, 19433 SDs, 0 SdLazy, 8083 SolverSat, 415 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 75247 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1890 NumberOfCodeBlocks, 1890 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1777 ConstructedInterpolants, 0 QuantifiedInterpolants, 357519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...