/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:32:45,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:32:45,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:32:45,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:32:45,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:32:45,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:32:45,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:32:45,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:32:45,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:32:45,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:32:45,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:32:45,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:32:45,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:32:45,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:32:45,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:32:45,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:32:45,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:32:45,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:32:45,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:32:45,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:32:45,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:32:45,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:32:45,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:32:45,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:32:45,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:32:45,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:32:45,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:32:45,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:32:45,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:32:45,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:32:45,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:32:45,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:32:45,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:32:45,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:32:45,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:32:45,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:32:45,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:32:45,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:32:45,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:32:45,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:32:45,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:32:45,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:32:45,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:32:45,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:32:45,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:32:45,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:32:45,099 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:32:45,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:32:45,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:32:45,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:32:45,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:32:45,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:32:45,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:32:45,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:32:45,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:32:45,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:32:45,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:32:45,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:32:45,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:32:45,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:32:45,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:32:45,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:32:45,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:32:45,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:32:45,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:32:45,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:32:45,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:32:45,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:32:45,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:32:45,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:32:45,106 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:32:45,106 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:32:45,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:32:45,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:32:45,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:32:45,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:32:45,457 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:32:45,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-26 23:32:45,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec9756c/3de13a6a65bd4ba2bce849ab9339a125/FLAG96b244663 [2019-12-26 23:32:46,030 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:32:46,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-26 23:32:46,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec9756c/3de13a6a65bd4ba2bce849ab9339a125/FLAG96b244663 [2019-12-26 23:32:46,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3ec9756c/3de13a6a65bd4ba2bce849ab9339a125 [2019-12-26 23:32:46,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:32:46,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:32:46,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:32:46,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:32:46,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:32:46,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:32:46" (1/1) ... [2019-12-26 23:32:46,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5046e964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:46, skipping insertion in model container [2019-12-26 23:32:46,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:32:46" (1/1) ... [2019-12-26 23:32:46,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:32:46,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:32:47,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:32:47,045 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:32:47,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:32:47,203 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:32:47,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47 WrapperNode [2019-12-26 23:32:47,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:32:47,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:32:47,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:32:47,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:32:47,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:32:47,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:32:47,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:32:47,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:32:47,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... [2019-12-26 23:32:47,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:32:47,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:32:47,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:32:47,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:32:47,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:32:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:32:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:32:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:32:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:32:47,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:32:47,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:32:47,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:32:47,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:32:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:32:47,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:32:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:32:47,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:32:47,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:32:47,396 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:32:48,199 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:32:48,200 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:32:48,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:32:48 BoogieIcfgContainer [2019-12-26 23:32:48,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:32:48,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:32:48,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:32:48,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:32:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:32:46" (1/3) ... [2019-12-26 23:32:48,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f66eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:32:48, skipping insertion in model container [2019-12-26 23:32:48,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:32:47" (2/3) ... [2019-12-26 23:32:48,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f66eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:32:48, skipping insertion in model container [2019-12-26 23:32:48,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:32:48" (3/3) ... [2019-12-26 23:32:48,211 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2019-12-26 23:32:48,222 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:32:48,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:32:48,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:32:48,233 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:32:48,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,283 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,302 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:32:48,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:32:48,373 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:32:48,373 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:32:48,374 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:32:48,374 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:32:48,374 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:32:48,374 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:32:48,374 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:32:48,374 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:32:48,398 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:32:48,400 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:32:48,529 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:32:48,529 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:32:48,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:32:48,570 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:32:48,623 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:32:48,623 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:32:48,633 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:32:48,654 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 23:32:48,655 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:32:53,966 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:32:54,081 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:32:54,105 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-26 23:32:54,105 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 23:32:54,109 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-26 23:33:10,309 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-26 23:33:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-26 23:33:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:33:10,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:33:10,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:33:10,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:33:10,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:33:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-26 23:33:10,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:33:10,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784727280] [2019-12-26 23:33:10,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:33:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:33:10,529 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-26 23:33:10,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784727280] [2019-12-26 23:33:10,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:33:10,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:33:10,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708970738] [2019-12-26 23:33:10,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:33:10,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:33:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:33:10,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:33:10,554 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-26 23:33:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:33:14,355 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-26 23:33:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:33:14,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:33:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:33:15,113 INFO L225 Difference]: With dead ends: 107108 [2019-12-26 23:33:15,113 INFO L226 Difference]: Without dead ends: 104924 [2019-12-26 23:33:15,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 23:33:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-26 23:33:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-26 23:33:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-26 23:33:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-26 23:33:23,822 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-26 23:33:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:33:23,823 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-26 23:33:23,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:33:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-26 23:33:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:33:23,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:33:23,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:33:23,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:33:23,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:33:23,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-26 23:33:23,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:33:23,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824077827] [2019-12-26 23:33:23,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:33:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:33:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:33:23,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824077827] [2019-12-26 23:33:23,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:33:23,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:33:23,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12993297] [2019-12-26 23:33:24,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:33:24,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:33:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:33:24,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:33:24,001 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-26 23:33:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:33:29,040 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-26 23:33:29,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:33:29,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:33:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:33:29,633 INFO L225 Difference]: With dead ends: 168606 [2019-12-26 23:33:29,633 INFO L226 Difference]: Without dead ends: 168557 [2019-12-26 23:33:29,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:33:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-26 23:33:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-26 23:33:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-26 23:33:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-26 23:33:38,223 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-26 23:33:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:33:38,223 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-26 23:33:38,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:33:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-26 23:33:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:33:38,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:33:38,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:33:38,233 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:33:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:33:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-26 23:33:38,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:33:38,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793523346] [2019-12-26 23:33:38,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:33:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:33:38,391 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-26 23:33:38,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793523346] [2019-12-26 23:33:38,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:33:38,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:33:38,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331404036] [2019-12-26 23:33:38,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:33:38,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:33:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:33:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:33:38,394 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-26 23:33:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:33:44,586 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-26 23:33:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:33:44,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:33:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:33:45,303 INFO L225 Difference]: With dead ends: 217678 [2019-12-26 23:33:45,304 INFO L226 Difference]: Without dead ends: 217615 [2019-12-26 23:33:45,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:33:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-26 23:33:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-26 23:33:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-26 23:33:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-26 23:33:55,628 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-26 23:33:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:33:55,629 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-26 23:33:55,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:33:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-26 23:33:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:33:55,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:33:55,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:33:55,634 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:33:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:33:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-26 23:33:55,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:33:55,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094948526] [2019-12-26 23:33:55,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:33:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:33:55,687 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-26 23:33:55,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094948526] [2019-12-26 23:33:55,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:33:55,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:33:55,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057331002] [2019-12-26 23:33:55,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:33:55,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:33:55,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:33:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:33:55,693 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-26 23:33:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:33:55,837 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-26 23:33:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:33:55,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:33:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:33:55,907 INFO L225 Difference]: With dead ends: 36985 [2019-12-26 23:33:55,907 INFO L226 Difference]: Without dead ends: 36985 [2019-12-26 23:33:55,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 23:33:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-26 23:33:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-26 23:33:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-26 23:34:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-26 23:34:02,469 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-26 23:34:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:02,469 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-26 23:34:02,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-26 23:34:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:34:02,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:02,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:02,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-26 23:34:02,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:02,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742251288] [2019-12-26 23:34:02,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:02,569 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-26 23:34:02,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742251288] [2019-12-26 23:34:02,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:02,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:34:02,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882273459] [2019-12-26 23:34:02,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:34:02,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:34:02,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:34:02,571 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-26 23:34:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:03,390 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-26 23:34:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:34:03,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:34:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:03,471 INFO L225 Difference]: With dead ends: 50257 [2019-12-26 23:34:03,471 INFO L226 Difference]: Without dead ends: 50244 [2019-12-26 23:34:03,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:34:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-26 23:34:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-26 23:34:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-26 23:34:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-26 23:34:04,201 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-26 23:34:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:04,201 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-26 23:34:04,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:34:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-26 23:34:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:34:04,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:04,213 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] [2019-12-26 23:34:04,213 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-26 23:34:04,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:04,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817006015] [2019-12-26 23:34:04,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:04,278 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-26 23:34:04,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817006015] [2019-12-26 23:34:04,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:04,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:34:04,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562026813] [2019-12-26 23:34:04,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:34:04,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:34:04,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:34:04,280 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-26 23:34:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:04,319 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-26 23:34:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:34:04,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:34:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:04,330 INFO L225 Difference]: With dead ends: 7104 [2019-12-26 23:34:04,331 INFO L226 Difference]: Without dead ends: 7104 [2019-12-26 23:34:04,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:34:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-26 23:34:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-26 23:34:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-26 23:34:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-26 23:34:04,444 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-26 23:34:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:04,444 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-26 23:34:04,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:34:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-26 23:34:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:34:04,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:04,455 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] [2019-12-26 23:34:04,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-26 23:34:04,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:04,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574950507] [2019-12-26 23:34:04,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:04,541 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-26 23:34:04,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574950507] [2019-12-26 23:34:04,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:34:04,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173845836] [2019-12-26 23:34:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:34:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:04,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:34:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:34:04,544 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-26 23:34:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:04,681 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-26 23:34:04,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:34:04,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:34:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:04,688 INFO L225 Difference]: With dead ends: 5024 [2019-12-26 23:34:04,689 INFO L226 Difference]: Without dead ends: 5024 [2019-12-26 23:34:04,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:34:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-26 23:34:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-26 23:34:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-26 23:34:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-26 23:34:04,758 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-26 23:34:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:04,758 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-26 23:34:04,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:34:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-26 23:34:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:34:04,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:04,765 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-26 23:34:04,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:04,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:04,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-26 23:34:04,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:04,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278977914] [2019-12-26 23:34:04,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:04,836 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-26 23:34:04,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278977914] [2019-12-26 23:34:04,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:04,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:34:04,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515633252] [2019-12-26 23:34:04,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:04,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:04,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:04,839 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:34:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:04,913 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-26 23:34:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:04,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:34:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:04,922 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:34:04,923 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:34:04,923 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-26 23:34:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:34:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:34:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:34:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-26 23:34:05,026 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-26 23:34:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:05,027 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-26 23:34:05,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-26 23:34:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:34:05,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:05,038 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-26 23:34:05,038 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-26 23:34:05,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:05,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780717633] [2019-12-26 23:34:05,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:05,108 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-26 23:34:05,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780717633] [2019-12-26 23:34:05,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:05,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:34:05,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057848836] [2019-12-26 23:34:05,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:05,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:05,111 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-26 23:34:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:05,167 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-26 23:34:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:05,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:34:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:05,174 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:34:05,174 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:34:05,175 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-26 23:34:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:34:05,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:34:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:34:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-26 23:34:05,264 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-26 23:34:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:05,264 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-26 23:34:05,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-26 23:34:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:34:05,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:05,273 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-26 23:34:05,274 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-26 23:34:05,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:05,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038147311] [2019-12-26 23:34:05,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:05,392 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-26 23:34:05,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038147311] [2019-12-26 23:34:05,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:05,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:34:05,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456316473] [2019-12-26 23:34:05,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:34:05,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:34:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:34:05,394 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-26 23:34:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:05,933 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-26 23:34:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:34:05,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:34:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:05,945 INFO L225 Difference]: With dead ends: 8765 [2019-12-26 23:34:05,945 INFO L226 Difference]: Without dead ends: 8765 [2019-12-26 23:34:05,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:34:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-26 23:34:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-26 23:34:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-26 23:34:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-26 23:34:06,034 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-26 23:34:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:06,035 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-26 23:34:06,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:34:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-26 23:34:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:34:06,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:06,042 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-26 23:34:06,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-26 23:34:06,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:06,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266976578] [2019-12-26 23:34:06,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:06,132 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-26 23:34:06,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266976578] [2019-12-26 23:34:06,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:06,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:34:06,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52763188] [2019-12-26 23:34:06,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:34:06,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:34:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:34:06,134 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-26 23:34:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:06,446 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-26 23:34:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:34:06,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:34:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:06,457 INFO L225 Difference]: With dead ends: 7981 [2019-12-26 23:34:06,457 INFO L226 Difference]: Without dead ends: 7981 [2019-12-26 23:34:06,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:34:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-26 23:34:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-26 23:34:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-26 23:34:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-26 23:34:06,547 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-26 23:34:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:06,547 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-26 23:34:06,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:34:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-26 23:34:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:34:06,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:06,556 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-26 23:34:06,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:06,557 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-26 23:34:06,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:06,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574112003] [2019-12-26 23:34:06,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:06,619 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-26 23:34:06,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574112003] [2019-12-26 23:34:06,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:06,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:34:06,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687046968] [2019-12-26 23:34:06,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:06,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:06,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:06,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:06,622 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-26 23:34:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:06,648 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-26 23:34:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:06,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:34:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:06,656 INFO L225 Difference]: With dead ends: 5119 [2019-12-26 23:34:06,656 INFO L226 Difference]: Without dead ends: 5119 [2019-12-26 23:34:06,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 23:34:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-26 23:34:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-26 23:34:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-26 23:34:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-26 23:34:06,744 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-26 23:34:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:06,744 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-26 23:34:06,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-26 23:34:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:34:06,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:06,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:06,754 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-26 23:34:06,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:06,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131042318] [2019-12-26 23:34:06,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:06,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-26 23:34:06,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131042318] [2019-12-26 23:34:06,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:06,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:34:06,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86148199] [2019-12-26 23:34:06,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:34:06,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:06,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:34:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:34:06,922 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 7 states. [2019-12-26 23:34:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:07,163 INFO L93 Difference]: Finished difference Result 16345 states and 46986 transitions. [2019-12-26 23:34:07,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:34:07,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 23:34:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:07,182 INFO L225 Difference]: With dead ends: 16345 [2019-12-26 23:34:07,183 INFO L226 Difference]: Without dead ends: 9717 [2019-12-26 23:34:07,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:34:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2019-12-26 23:34:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 4839. [2019-12-26 23:34:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-26 23:34:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13731 transitions. [2019-12-26 23:34:07,319 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13731 transitions. Word has length 66 [2019-12-26 23:34:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:07,320 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13731 transitions. [2019-12-26 23:34:07,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:34:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13731 transitions. [2019-12-26 23:34:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:34:07,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:07,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:07,329 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1675270619, now seen corresponding path program 2 times [2019-12-26 23:34:07,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:07,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984402019] [2019-12-26 23:34:07,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:34:07,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984402019] [2019-12-26 23:34:07,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:07,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:34:07,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159222973] [2019-12-26 23:34:07,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:34:07,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:07,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:34:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:34:07,414 INFO L87 Difference]: Start difference. First operand 4839 states and 13731 transitions. Second operand 5 states. [2019-12-26 23:34:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:07,720 INFO L93 Difference]: Finished difference Result 7264 states and 20476 transitions. [2019-12-26 23:34:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:34:07,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:34:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:07,735 INFO L225 Difference]: With dead ends: 7264 [2019-12-26 23:34:07,735 INFO L226 Difference]: Without dead ends: 7264 [2019-12-26 23:34:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:34:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7264 states. [2019-12-26 23:34:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7264 to 5890. [2019-12-26 23:34:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5890 states. [2019-12-26 23:34:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 16755 transitions. [2019-12-26 23:34:07,963 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 16755 transitions. Word has length 66 [2019-12-26 23:34:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:07,963 INFO L462 AbstractCegarLoop]: Abstraction has 5890 states and 16755 transitions. [2019-12-26 23:34:07,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:34:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 16755 transitions. [2019-12-26 23:34:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:34:07,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:07,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:07,977 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash 152644773, now seen corresponding path program 3 times [2019-12-26 23:34:07,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:07,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038941289] [2019-12-26 23:34:07,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:34:08,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038941289] [2019-12-26 23:34:08,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:08,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:34:08,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486333524] [2019-12-26 23:34:08,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:08,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:08,046 INFO L87 Difference]: Start difference. First operand 5890 states and 16755 transitions. Second operand 3 states. [2019-12-26 23:34:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:08,073 INFO L93 Difference]: Finished difference Result 5361 states and 14946 transitions. [2019-12-26 23:34:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:08,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:34:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:08,081 INFO L225 Difference]: With dead ends: 5361 [2019-12-26 23:34:08,081 INFO L226 Difference]: Without dead ends: 5361 [2019-12-26 23:34:08,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 23:34:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5361 states. [2019-12-26 23:34:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5361 to 5169. [2019-12-26 23:34:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2019-12-26 23:34:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 14432 transitions. [2019-12-26 23:34:08,187 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 14432 transitions. Word has length 66 [2019-12-26 23:34:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:08,188 INFO L462 AbstractCegarLoop]: Abstraction has 5169 states and 14432 transitions. [2019-12-26 23:34:08,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 14432 transitions. [2019-12-26 23:34:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:34:08,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:08,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:08,199 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1603018859, now seen corresponding path program 1 times [2019-12-26 23:34:08,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:08,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86409809] [2019-12-26 23:34:08,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:08,268 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-26 23:34:08,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86409809] [2019-12-26 23:34:08,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:08,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:34:08,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246916676] [2019-12-26 23:34:08,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:34:08,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:34:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:34:08,272 INFO L87 Difference]: Start difference. First operand 5169 states and 14432 transitions. Second operand 3 states. [2019-12-26 23:34:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:08,326 INFO L93 Difference]: Finished difference Result 5169 states and 14431 transitions. [2019-12-26 23:34:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:34:08,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:34:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:08,333 INFO L225 Difference]: With dead ends: 5169 [2019-12-26 23:34:08,334 INFO L226 Difference]: Without dead ends: 5169 [2019-12-26 23:34:08,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 23:34:08,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-12-26 23:34:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 2988. [2019-12-26 23:34:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-26 23:34:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8386 transitions. [2019-12-26 23:34:08,392 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8386 transitions. Word has length 67 [2019-12-26 23:34:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:08,392 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8386 transitions. [2019-12-26 23:34:08,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:34:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8386 transitions. [2019-12-26 23:34:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:34:08,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:08,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:08,397 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 1 times [2019-12-26 23:34:08,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:08,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955619305] [2019-12-26 23:34:08,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:08,518 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-26 23:34:08,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955619305] [2019-12-26 23:34:08,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:08,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:34:08,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502020329] [2019-12-26 23:34:08,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:34:08,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:08,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:34:08,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:34:08,520 INFO L87 Difference]: Start difference. First operand 2988 states and 8386 transitions. Second operand 6 states. [2019-12-26 23:34:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:08,609 INFO L93 Difference]: Finished difference Result 5166 states and 14516 transitions. [2019-12-26 23:34:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:34:08,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-26 23:34:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:08,613 INFO L225 Difference]: With dead ends: 5166 [2019-12-26 23:34:08,613 INFO L226 Difference]: Without dead ends: 2316 [2019-12-26 23:34:08,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:34:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-12-26 23:34:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1947. [2019-12-26 23:34:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-12-26 23:34:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 5393 transitions. [2019-12-26 23:34:08,642 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 5393 transitions. Word has length 68 [2019-12-26 23:34:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:08,642 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 5393 transitions. [2019-12-26 23:34:08,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:34:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 5393 transitions. [2019-12-26 23:34:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:34:08,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:08,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:08,646 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash -213601006, now seen corresponding path program 2 times [2019-12-26 23:34:08,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:08,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116417324] [2019-12-26 23:34:08,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:34:08,770 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-26 23:34:08,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116417324] [2019-12-26 23:34:08,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:34:08,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:34:08,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810503229] [2019-12-26 23:34:08,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:34:08,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:34:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:34:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:34:08,772 INFO L87 Difference]: Start difference. First operand 1947 states and 5393 transitions. Second operand 7 states. [2019-12-26 23:34:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:34:08,870 INFO L93 Difference]: Finished difference Result 4100 states and 11452 transitions. [2019-12-26 23:34:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:34:08,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-26 23:34:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:34:08,876 INFO L225 Difference]: With dead ends: 4100 [2019-12-26 23:34:08,876 INFO L226 Difference]: Without dead ends: 2197 [2019-12-26 23:34:08,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:34:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-26 23:34:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1804. [2019-12-26 23:34:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-26 23:34:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 5006 transitions. [2019-12-26 23:34:08,936 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 5006 transitions. Word has length 68 [2019-12-26 23:34:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:34:08,936 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 5006 transitions. [2019-12-26 23:34:08,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:34:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 5006 transitions. [2019-12-26 23:34:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:34:08,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:34:08,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:34:08,941 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:34:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:34:08,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-26 23:34:08,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:34:08,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089799891] [2019-12-26 23:34:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:34:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:34:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:34:09,088 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:34:09,088 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:34:09,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20|)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1876~0.base_20| 4) |v_#length_25|) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (= |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1876~0.base_20|) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20|) |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20| 1)) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1876~0.offset=|v_ULTIMATE.start_main_~#t1876~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_~#t1876~0.base=|v_ULTIMATE.start_main_~#t1876~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_20|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1878~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1876~0.offset, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1877~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t1876~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1878~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:34:09,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1877~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1877~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1877~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11|) |v_ULTIMATE.start_main_~#t1877~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1877~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_11|, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_~#t1877~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:34:09,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1878~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t1878~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1878~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9|) |v_ULTIMATE.start_main_~#t1878~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1878~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1878~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1878~0.base] because there is no mapped edge [2019-12-26 23:34:09,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:34:09,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-62718061 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-62718061 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-62718061| ~x$w_buff1~0_In-62718061)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-62718061| ~x~0_In-62718061)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-62718061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-62718061, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-62718061, ~x~0=~x~0_In-62718061} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-62718061|, ~x$w_buff1~0=~x$w_buff1~0_In-62718061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-62718061, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-62718061, ~x~0=~x~0_In-62718061} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:34:09,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:34:09,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1256563830 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1256563830 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out1256563830| ~x$w_buff0_used~0_In1256563830) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1256563830| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1256563830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1256563830} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1256563830, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1256563830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1256563830} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:34:09,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2065238238 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-2065238238 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2065238238 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-2065238238 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-2065238238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-2065238238 |P2Thread1of1ForFork2_#t~ite18_Out-2065238238|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065238238, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2065238238, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2065238238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2065238238} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2065238238, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2065238238, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2065238238, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-2065238238|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2065238238} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:34:09,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out2142325399| |P0Thread1of1ForFork0_#t~ite4_Out2142325399|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2142325399 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2142325399 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In2142325399 |P0Thread1of1ForFork0_#t~ite3_Out2142325399|)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out2142325399| ~x$w_buff1~0_In2142325399) .cse2 (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2142325399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142325399, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2142325399, ~x~0=~x~0_In2142325399} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out2142325399|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out2142325399|, ~x$w_buff1~0=~x$w_buff1~0_In2142325399, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2142325399, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2142325399, ~x~0=~x~0_In2142325399} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:34:09,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1962627207 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1962627207 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1962627207| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1962627207| ~x$w_buff0_used~0_In-1962627207)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1962627207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1962627207} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1962627207|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1962627207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1962627207} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:34:09,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2125064542 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-2125064542 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2125064542 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-2125064542 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2125064542|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2125064542| ~x$w_buff1_used~0_In-2125064542)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2125064542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125064542, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2125064542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125064542} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2125064542|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2125064542, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125064542, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2125064542, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125064542} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:34:09,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In900388080 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In900388080 256)))) (or (and (= ~x$r_buff0_thd3~0_In900388080 |P2Thread1of1ForFork2_#t~ite19_Out900388080|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out900388080|) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In900388080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In900388080} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In900388080, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out900388080|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In900388080} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:34:09,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In621547805 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In621547805 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In621547805 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In621547805 256)))) (or (and (= ~x$r_buff1_thd3~0_In621547805 |P2Thread1of1ForFork2_#t~ite20_Out621547805|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out621547805| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In621547805, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In621547805, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In621547805, ~x$w_buff0_used~0=~x$w_buff0_used~0_In621547805} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out621547805|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In621547805, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In621547805, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In621547805, ~x$w_buff0_used~0=~x$w_buff0_used~0_In621547805} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:34:09,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:34:09,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In939996803 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In939996803 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out939996803|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In939996803 |P0Thread1of1ForFork0_#t~ite7_Out939996803|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In939996803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In939996803} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In939996803, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out939996803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In939996803} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:34:09,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-91662603 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-91662603 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-91662603 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-91662603 256)))) (or (and (= ~x$r_buff1_thd1~0_In-91662603 |P0Thread1of1ForFork0_#t~ite8_Out-91662603|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-91662603|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-91662603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-91662603, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-91662603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91662603} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-91662603, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-91662603|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-91662603, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-91662603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-91662603} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:34:09,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:34:09,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-225082888 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-225082888 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-225082888|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-225082888 |P1Thread1of1ForFork1_#t~ite11_Out-225082888|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-225082888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225082888} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-225082888|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-225082888, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-225082888} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:34:09,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1930461048 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1930461048 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1930461048 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1930461048 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1930461048| ~x$w_buff1_used~0_In-1930461048) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1930461048| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1930461048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1930461048, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1930461048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1930461048} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1930461048, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1930461048, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1930461048|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1930461048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1930461048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:34:09,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In563499812 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In563499812 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In563499812 ~x$r_buff0_thd2~0_Out563499812)) (and (= 0 ~x$r_buff0_thd2~0_Out563499812) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In563499812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563499812} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out563499812|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out563499812, ~x$w_buff0_used~0=~x$w_buff0_used~0_In563499812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:34:09,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-496358353 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-496358353 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-496358353 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-496358353 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-496358353| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-496358353| ~x$r_buff1_thd2~0_In-496358353) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-496358353, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-496358353, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-496358353, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-496358353} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-496358353, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-496358353, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-496358353, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-496358353|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-496358353} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:34:09,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:34:09,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:34:09,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-712265834| |ULTIMATE.start_main_#t~ite24_Out-712265834|)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-712265834 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-712265834 256)))) (or (and .cse0 (= ~x~0_In-712265834 |ULTIMATE.start_main_#t~ite24_Out-712265834|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~x$w_buff1~0_In-712265834 |ULTIMATE.start_main_#t~ite24_Out-712265834|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-712265834, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-712265834, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-712265834, ~x~0=~x~0_In-712265834} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-712265834, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-712265834|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-712265834|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-712265834, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-712265834, ~x~0=~x~0_In-712265834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:34:09,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In958728109 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In958728109 256)))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out958728109| ~x$w_buff0_used~0_In958728109) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out958728109| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958728109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958728109} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In958728109, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out958728109|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958728109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:34:09,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1419069691 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1419069691 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1419069691 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1419069691 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1419069691| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1419069691 |ULTIMATE.start_main_#t~ite27_Out1419069691|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1419069691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1419069691, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1419069691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1419069691} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1419069691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1419069691, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1419069691|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1419069691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1419069691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:34:09,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In720757199 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In720757199 256)))) (or (and (= ~x$r_buff0_thd0~0_In720757199 |ULTIMATE.start_main_#t~ite28_Out720757199|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out720757199|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In720757199, ~x$w_buff0_used~0=~x$w_buff0_used~0_In720757199} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In720757199, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out720757199|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In720757199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:34:09,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-856040228 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-856040228 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-856040228 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-856040228 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-856040228|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-856040228 |ULTIMATE.start_main_#t~ite29_Out-856040228|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-856040228, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-856040228, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-856040228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-856040228} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-856040228, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-856040228|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-856040228, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-856040228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-856040228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:34:09,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:34:09,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:34:09,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:34:09,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:34:09 BasicIcfg [2019-12-26 23:34:09,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:34:09,293 INFO L168 Benchmark]: Toolchain (without parser) took 82941.14 ms. Allocated memory was 134.7 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 98.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,297 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.05 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 97.6 MB in the beginning and 150.4 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.84 ms. Allocated memory is still 199.2 MB. Free memory was 150.4 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,300 INFO L168 Benchmark]: Boogie Preprocessor took 41.31 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 145.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,301 INFO L168 Benchmark]: RCFGBuilder took 873.56 ms. Allocated memory is still 199.2 MB. Free memory was 145.2 MB in the beginning and 94.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,301 INFO L168 Benchmark]: TraceAbstraction took 81088.27 ms. Allocated memory was 199.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-26 23:34:09,315 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.45 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.05 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 97.6 MB in the beginning and 150.4 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.84 ms. Allocated memory is still 199.2 MB. Free memory was 150.4 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.31 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 145.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 873.56 ms. Allocated memory is still 199.2 MB. Free memory was 145.2 MB in the beginning and 94.5 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 81088.27 ms. Allocated memory was 199.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 94.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 80.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2613 SDtfs, 2047 SDslu, 4369 SDs, 0 SdLazy, 2044 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 78733 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 917 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 831 ConstructedInterpolants, 0 QuantifiedInterpolants, 143584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...