/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/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:14:13,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:14:13,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:14:13,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:14:13,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:14:13,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:14:13,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:14:13,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:14:13,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:14:13,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:14:13,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:14:13,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:14:13,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:14:13,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:14:13,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:14:13,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:14:13,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:14:13,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:14:13,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:14:13,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:14:13,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:14:13,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:14:13,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:14:13,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:14:13,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:14:13,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:14:13,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:14:13,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:14:13,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:14:13,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:14:13,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:14:13,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:14:13,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:14:13,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:14:13,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:14:13,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:14:13,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:14:13,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:14:13,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:14:13,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:14:13,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:14:13,258 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-27 00:14:13,277 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:14:13,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:14:13,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:14:13,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:14:13,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:14:13,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:14:13,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:14:13,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:14:13,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:14:13,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:14:13,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:14:13,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:14:13,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:14:13,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:14:13,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:14:13,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:14:13,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:14:13,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:14:13,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:14:13,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:14:13,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:14:13,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:14:13,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:14:13,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:14:13,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:14:13,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:14:13,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:14:13,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:14:13,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:14:13,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:14:13,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:14:13,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:14:13,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:14:13,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:14:13,649 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:14:13,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-27 00:14:13,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3441fbf2/16065f66c4354aef93faa1dd80f002b8/FLAGda7994fba [2019-12-27 00:14:14,318 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:14:14,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2019-12-27 00:14:14,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3441fbf2/16065f66c4354aef93faa1dd80f002b8/FLAGda7994fba [2019-12-27 00:14:14,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3441fbf2/16065f66c4354aef93faa1dd80f002b8 [2019-12-27 00:14:14,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:14:14,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:14:14,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:14:14,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:14:14,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:14:14,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:14:14" (1/1) ... [2019-12-27 00:14:14,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be3ea45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:14, skipping insertion in model container [2019-12-27 00:14:14,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:14:14" (1/1) ... [2019-12-27 00:14:14,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:14:14,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:14:15,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:14:15,207 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:14:15,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:14:15,400 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:14:15,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15 WrapperNode [2019-12-27 00:14:15,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:14:15,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:14:15,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:14:15,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:14:15,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:14:15,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:14:15,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:14:15,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:14:15,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (1/1) ... [2019-12-27 00:14:15,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:14:15,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:14:15,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:14:15,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:14:15,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (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-27 00:14:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:14:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:14:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:14:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:14:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:14:15,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:14:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:14:15,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:14:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:14:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:14:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:14:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:14:15,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:14:15,592 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:14:16,280 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:14:16,280 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:14:16,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:14:16 BoogieIcfgContainer [2019-12-27 00:14:16,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:14:16,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:14:16,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:14:16,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:14:16,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:14:14" (1/3) ... [2019-12-27 00:14:16,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e476765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:14:16, skipping insertion in model container [2019-12-27 00:14:16,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:14:15" (2/3) ... [2019-12-27 00:14:16,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e476765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:14:16, skipping insertion in model container [2019-12-27 00:14:16,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:14:16" (3/3) ... [2019-12-27 00:14:16,294 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2019-12-27 00:14:16,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:14:16,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:14:16,315 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:14:16,316 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:14:16,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,386 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,397 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,399 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,426 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:14:16,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:14:16,462 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:14:16,463 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:14:16,463 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:14:16,463 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:14:16,464 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:14:16,467 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:14:16,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:14:16,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:14:16,490 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 00:14:16,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:14:16,581 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:14:16,581 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:14:16,594 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:14:16,613 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:14:16,660 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:14:16,660 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:14:16,666 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 00:14:16,679 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 00:14:16,680 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:14:21,362 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:14:21,493 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:14:21,517 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-27 00:14:21,517 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 00:14:21,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-27 00:14:22,586 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-27 00:14:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-27 00:14:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:14:22,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:22,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:22,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-27 00:14:22,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:22,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636984694] [2019-12-27 00:14:22,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:22,883 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-27 00:14:22,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636984694] [2019-12-27 00:14:22,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:22,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:14:22,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627581118] [2019-12-27 00:14:22,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:22,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:22,910 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-27 00:14:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:23,278 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-27 00:14:23,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:23,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 00:14:23,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:23,457 INFO L225 Difference]: With dead ends: 15638 [2019-12-27 00:14:23,458 INFO L226 Difference]: Without dead ends: 15326 [2019-12-27 00:14:23,459 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-27 00:14:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-27 00:14:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-27 00:14:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-27 00:14:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-27 00:14:24,726 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-27 00:14:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:24,727 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-27 00:14:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-27 00:14:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:24,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:24,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:24,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-27 00:14:24,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:24,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845229108] [2019-12-27 00:14:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:24,900 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-27 00:14:24,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845229108] [2019-12-27 00:14:24,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:24,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:24,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112310341] [2019-12-27 00:14:24,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:24,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:24,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:24,905 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-27 00:14:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:25,584 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-27 00:14:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:25,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:14:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:25,692 INFO L225 Difference]: With dead ends: 24490 [2019-12-27 00:14:25,692 INFO L226 Difference]: Without dead ends: 24476 [2019-12-27 00:14:25,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-27 00:14:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-27 00:14:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-27 00:14:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-27 00:14:26,590 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-27 00:14:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-27 00:14:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-27 00:14:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:26,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:26,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:26,592 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-27 00:14:26,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:26,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084117263] [2019-12-27 00:14:26,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:26,659 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-27 00:14:26,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084117263] [2019-12-27 00:14:26,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:26,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:26,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514988140] [2019-12-27 00:14:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:26,664 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-27 00:14:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:26,725 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-27 00:14:26,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:26,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:14:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:26,778 INFO L225 Difference]: With dead ends: 12702 [2019-12-27 00:14:26,779 INFO L226 Difference]: Without dead ends: 12702 [2019-12-27 00:14:26,779 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-27 00:14:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-27 00:14:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-27 00:14:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-27 00:14:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-27 00:14:28,009 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-27 00:14:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,009 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-27 00:14:28,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-27 00:14:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:14:28,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:28,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-27 00:14:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327319342] [2019-12-27 00:14:28,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:28,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327319342] [2019-12-27 00:14:28,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:28,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:28,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246420795] [2019-12-27 00:14:28,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:28,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:28,056 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-27 00:14:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:28,077 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-27 00:14:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:14:28,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:14:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:28,085 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 00:14:28,085 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 00:14:28,085 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-27 00:14:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 00:14:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 00:14:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 00:14:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-27 00:14:28,120 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-27 00:14:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,120 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-27 00:14:28,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-27 00:14:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:14:28,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,123 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] [2019-12-27 00:14:28,123 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-27 00:14:28,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530239767] [2019-12-27 00:14:28,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:28,217 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-27 00:14:28,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530239767] [2019-12-27 00:14:28,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:28,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:14:28,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412054121] [2019-12-27 00:14:28,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:14:28,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:14:28,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:28,220 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-27 00:14:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:28,244 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-27 00:14:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:28,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 00:14:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:28,246 INFO L225 Difference]: With dead ends: 630 [2019-12-27 00:14:28,246 INFO L226 Difference]: Without dead ends: 630 [2019-12-27 00:14:28,246 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-27 00:14:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-27 00:14:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-27 00:14:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 00:14:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-27 00:14:28,256 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-27 00:14:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,257 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-27 00:14:28,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:14:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-27 00:14:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:28,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:28,260 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-27 00:14:28,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108726959] [2019-12-27 00:14:28,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:28,345 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-27 00:14:28,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108726959] [2019-12-27 00:14:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:28,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:28,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678215557] [2019-12-27 00:14:28,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:28,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:28,349 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-27 00:14:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:28,409 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-27 00:14:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:28,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:14:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:28,411 INFO L225 Difference]: With dead ends: 584 [2019-12-27 00:14:28,412 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 00:14:28,412 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-27 00:14:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 00:14:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-27 00:14:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 00:14:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-27 00:14:28,423 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-27 00:14:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,424 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-27 00:14:28,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-27 00:14:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:28,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:28,426 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-27 00:14:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347403840] [2019-12-27 00:14:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:28,526 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-27 00:14:28,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347403840] [2019-12-27 00:14:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:28,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:28,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639025451] [2019-12-27 00:14:28,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:28,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:28,528 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 3 states. [2019-12-27 00:14:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:28,546 INFO L93 Difference]: Finished difference Result 580 states and 1326 transitions. [2019-12-27 00:14:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:28,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:14:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:28,548 INFO L225 Difference]: With dead ends: 580 [2019-12-27 00:14:28,548 INFO L226 Difference]: Without dead ends: 580 [2019-12-27 00:14:28,548 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-27 00:14:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-27 00:14:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-12-27 00:14:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 00:14:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1326 transitions. [2019-12-27 00:14:28,558 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1326 transitions. Word has length 55 [2019-12-27 00:14:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,558 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1326 transitions. [2019-12-27 00:14:28,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1326 transitions. [2019-12-27 00:14:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:28,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:28,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1916501781, now seen corresponding path program 1 times [2019-12-27 00:14:28,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344352542] [2019-12-27 00:14:28,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:28,698 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-27 00:14:28,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344352542] [2019-12-27 00:14:28,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:28,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:14:28,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243355167] [2019-12-27 00:14:28,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:14:28,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:14:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:28,700 INFO L87 Difference]: Start difference. First operand 580 states and 1326 transitions. Second operand 5 states. [2019-12-27 00:14:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:28,902 INFO L93 Difference]: Finished difference Result 851 states and 1949 transitions. [2019-12-27 00:14:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:14:28,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 00:14:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:28,904 INFO L225 Difference]: With dead ends: 851 [2019-12-27 00:14:28,904 INFO L226 Difference]: Without dead ends: 851 [2019-12-27 00:14:28,905 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-27 00:14:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-12-27 00:14:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 664. [2019-12-27 00:14:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-12-27 00:14:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1530 transitions. [2019-12-27 00:14:28,917 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1530 transitions. Word has length 56 [2019-12-27 00:14:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:28,917 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1530 transitions. [2019-12-27 00:14:28,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:14:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1530 transitions. [2019-12-27 00:14:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:28,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:28,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:28,920 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:28,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash 510672277, now seen corresponding path program 2 times [2019-12-27 00:14:28,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:28,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588455388] [2019-12-27 00:14:28,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:29,098 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-27 00:14:29,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588455388] [2019-12-27 00:14:29,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:29,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:14:29,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016258841] [2019-12-27 00:14:29,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:29,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:29,100 INFO L87 Difference]: Start difference. First operand 664 states and 1530 transitions. Second operand 6 states. [2019-12-27 00:14:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:29,194 INFO L93 Difference]: Finished difference Result 1010 states and 2162 transitions. [2019-12-27 00:14:29,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:14:29,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 00:14:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:29,197 INFO L225 Difference]: With dead ends: 1010 [2019-12-27 00:14:29,197 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 00:14:29,198 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-27 00:14:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 00:14:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 602. [2019-12-27 00:14:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-12-27 00:14:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1351 transitions. [2019-12-27 00:14:29,212 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1351 transitions. Word has length 56 [2019-12-27 00:14:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:29,212 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 1351 transitions. [2019-12-27 00:14:29,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1351 transitions. [2019-12-27 00:14:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:29,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:29,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:29,215 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:29,216 INFO L82 PathProgramCache]: Analyzing trace with hash 773779733, now seen corresponding path program 3 times [2019-12-27 00:14:29,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:29,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626461629] [2019-12-27 00:14:29,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:29,388 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-27 00:14:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626461629] [2019-12-27 00:14:29,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:29,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:14:29,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113889583] [2019-12-27 00:14:29,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:14:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:14:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:14:29,390 INFO L87 Difference]: Start difference. First operand 602 states and 1351 transitions. Second operand 7 states. [2019-12-27 00:14:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:29,586 INFO L93 Difference]: Finished difference Result 955 states and 2063 transitions. [2019-12-27 00:14:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:14:29,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 00:14:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:29,587 INFO L225 Difference]: With dead ends: 955 [2019-12-27 00:14:29,588 INFO L226 Difference]: Without dead ends: 324 [2019-12-27 00:14:29,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:14:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-12-27 00:14:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 294. [2019-12-27 00:14:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-12-27 00:14:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 520 transitions. [2019-12-27 00:14:29,597 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 520 transitions. Word has length 56 [2019-12-27 00:14:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:29,600 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 520 transitions. [2019-12-27 00:14:29,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:14:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 520 transitions. [2019-12-27 00:14:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:29,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:29,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:29,604 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:29,604 INFO L82 PathProgramCache]: Analyzing trace with hash 125210929, now seen corresponding path program 4 times [2019-12-27 00:14:29,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:29,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950474806] [2019-12-27 00:14:29,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:29,782 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-27 00:14:29,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950474806] [2019-12-27 00:14:29,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:29,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:14:29,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564840381] [2019-12-27 00:14:29,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:14:29,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:29,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:14:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:14:29,785 INFO L87 Difference]: Start difference. First operand 294 states and 520 transitions. Second operand 8 states. [2019-12-27 00:14:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:30,166 INFO L93 Difference]: Finished difference Result 525 states and 930 transitions. [2019-12-27 00:14:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 00:14:30,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-27 00:14:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:30,168 INFO L225 Difference]: With dead ends: 525 [2019-12-27 00:14:30,168 INFO L226 Difference]: Without dead ends: 525 [2019-12-27 00:14:30,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:14:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-12-27 00:14:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 336. [2019-12-27 00:14:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 00:14:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 597 transitions. [2019-12-27 00:14:30,175 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 597 transitions. Word has length 56 [2019-12-27 00:14:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:30,176 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 597 transitions. [2019-12-27 00:14:30,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:14:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 597 transitions. [2019-12-27 00:14:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:30,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:30,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:30,177 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:30,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash 791586909, now seen corresponding path program 5 times [2019-12-27 00:14:30,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:30,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535025886] [2019-12-27 00:14:30,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:30,238 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-27 00:14:30,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535025886] [2019-12-27 00:14:30,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:30,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:30,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768169088] [2019-12-27 00:14:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:30,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:30,240 INFO L87 Difference]: Start difference. First operand 336 states and 597 transitions. Second operand 3 states. [2019-12-27 00:14:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:30,282 INFO L93 Difference]: Finished difference Result 336 states and 596 transitions. [2019-12-27 00:14:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:30,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 00:14:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:30,283 INFO L225 Difference]: With dead ends: 336 [2019-12-27 00:14:30,284 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 00:14:30,284 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-27 00:14:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 00:14:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 209. [2019-12-27 00:14:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 00:14:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 365 transitions. [2019-12-27 00:14:30,288 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 365 transitions. Word has length 56 [2019-12-27 00:14:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:30,288 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 365 transitions. [2019-12-27 00:14:30,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 365 transitions. [2019-12-27 00:14:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:30,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:30,290 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] [2019-12-27 00:14:30,290 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 1 times [2019-12-27 00:14:30,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:30,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297806245] [2019-12-27 00:14:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:30,571 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-27 00:14:30,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297806245] [2019-12-27 00:14:30,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:30,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:14:30,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138718779] [2019-12-27 00:14:30,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 00:14:30,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 00:14:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 00:14:30,573 INFO L87 Difference]: Start difference. First operand 209 states and 365 transitions. Second operand 14 states. [2019-12-27 00:14:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:31,266 INFO L93 Difference]: Finished difference Result 378 states and 643 transitions. [2019-12-27 00:14:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:14:31,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 00:14:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:31,267 INFO L225 Difference]: With dead ends: 378 [2019-12-27 00:14:31,268 INFO L226 Difference]: Without dead ends: 343 [2019-12-27 00:14:31,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:14:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-27 00:14:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-27 00:14:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 00:14:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 536 transitions. [2019-12-27 00:14:31,274 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 536 transitions. Word has length 57 [2019-12-27 00:14:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:31,275 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 536 transitions. [2019-12-27 00:14:31,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 00:14:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 536 transitions. [2019-12-27 00:14:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:31,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:31,276 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] [2019-12-27 00:14:31,277 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 2 times [2019-12-27 00:14:31,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:31,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882087991] [2019-12-27 00:14:31,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:31,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882087991] [2019-12-27 00:14:31,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:31,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 00:14:31,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521168016] [2019-12-27 00:14:31,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:14:31,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:14:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:14:31,575 INFO L87 Difference]: Start difference. First operand 309 states and 536 transitions. Second operand 12 states. [2019-12-27 00:14:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:31,900 INFO L93 Difference]: Finished difference Result 412 states and 691 transitions. [2019-12-27 00:14:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:14:31,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 00:14:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:31,902 INFO L225 Difference]: With dead ends: 412 [2019-12-27 00:14:31,902 INFO L226 Difference]: Without dead ends: 379 [2019-12-27 00:14:31,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 00:14:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-27 00:14:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-27 00:14:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 00:14:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 550 transitions. [2019-12-27 00:14:31,908 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 550 transitions. Word has length 57 [2019-12-27 00:14:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:31,908 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 550 transitions. [2019-12-27 00:14:31,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:14:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 550 transitions. [2019-12-27 00:14:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:31,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:31,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:31,910 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 3 times [2019-12-27 00:14:31,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:31,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264058263] [2019-12-27 00:14:31,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:32,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:14:32,046 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:14:32,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~y$w_buff1~0_198 0) (= v_~x~0_55 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22|) 0) (= v_~weak$$choice2~0_120 0) (= v_~main$tmp_guard1~0_31 0) (= v_~y$r_buff1_thd0~0_279 0) (= 0 v_~y$r_buff1_thd2~0_191) (= v_~y$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2528~0.base_22| 1) |v_#valid_53|) (= 0 v_~y$w_buff0~0_215) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2528~0.base_22|) |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2528~0.base_22| 4)) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2528~0.base_22|) (= 0 v_~__unbuffered_p0_EAX~0_42) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_20 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~y$flush_delayed~0_42) (= 0 v_~y$r_buff0_thd2~0_116) (= v_~y$w_buff1_used~0_397 0) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard0~0_26 0) (= |v_ULTIMATE.start_main_~#t2528~0.offset_17| 0) (= 0 v_~y$r_buff1_thd3~0_162) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~y$r_buff1_thd1~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_40|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_23|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_46|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, #length=|v_#length_21|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_27|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_35|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_60|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_65|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ~y$w_buff1~0=v_~y$w_buff1~0_198, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_116, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_279, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_623, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_44|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_18|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_31|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_129|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_28|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_37|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_25|, ~y$w_buff0~0=v_~y$w_buff0~0_215, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_201, ~y~0=v_~y~0_147, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_31|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_34|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_64|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_24|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_19|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ULTIMATE.start_main_~#t2528~0.base=|v_ULTIMATE.start_main_~#t2528~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_331, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_120, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_15|, ULTIMATE.start_main_~#t2528~0.offset=|v_ULTIMATE.start_main_~#t2528~0.offset_17|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2530~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2529~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2529~0.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2528~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2530~0.offset, ULTIMATE.start_main_~#t2528~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:14:32,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t2529~0.offset_10| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2529~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2529~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2529~0.base_11|) |v_ULTIMATE.start_main_~#t2529~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2529~0.base_11| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2529~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2529~0.base=|v_ULTIMATE.start_main_~#t2529~0.base_11|, ULTIMATE.start_main_~#t2529~0.offset=|v_ULTIMATE.start_main_~#t2529~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2529~0.base, ULTIMATE.start_main_~#t2529~0.offset] because there is no mapped edge [2019-12-27 00:14:32,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2530~0.base_10|) |v_ULTIMATE.start_main_~#t2530~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2530~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2530~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2530~0.base_10| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2530~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2530~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2530~0.base=|v_ULTIMATE.start_main_~#t2530~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2530~0.offset=|v_ULTIMATE.start_main_~#t2530~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2530~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2530~0.offset] because there is no mapped edge [2019-12-27 00:14:32,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [616] [616] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_24) (= 2 v_~y$w_buff0~0_28) (= |v_P2Thread1of1ForFork0_#in~arg.base_11| v_P2Thread1of1ForFork0_~arg.base_11) (= v_~y$w_buff0_used~0_103 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_11| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff1_used~0_54 v_~y$w_buff0_used~0_104) (= 0 (mod v_~y$w_buff1_used~0_54 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_29, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_11|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_28, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:14:32,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_15| 0) (= 0 |v_P0Thread1of1ForFork1_#res.offset_15|) (= v_~x~0_47 v_~__unbuffered_p0_EAX~0_32) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~z~0_109 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_15|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, ~z~0=v_~z~0_109, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_47, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 00:14:32,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1449850179 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1449850179 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1449850179|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1449850179 |P2Thread1of1ForFork0_#t~ite11_Out1449850179|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1449850179, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1449850179} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1449850179, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1449850179|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1449850179} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 00:14:32,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-1890456393| |P1Thread1of1ForFork2_#t~ite3_Out-1890456393|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1890456393 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1890456393 256)))) (or (and .cse0 (= ~y~0_In-1890456393 |P1Thread1of1ForFork2_#t~ite3_Out-1890456393|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1890456393| ~y$w_buff1~0_In-1890456393)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1890456393, ~y$w_buff1~0=~y$w_buff1~0_In-1890456393, ~y~0=~y~0_In-1890456393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1890456393} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1890456393, ~y$w_buff1~0=~y$w_buff1~0_In-1890456393, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1890456393|, ~y~0=~y~0_In-1890456393, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1890456393|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1890456393} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 00:14:32,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1897048059 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1897048059 256)))) (or (and (= ~y$w_buff0_used~0_In1897048059 |P1Thread1of1ForFork2_#t~ite5_Out1897048059|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out1897048059| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1897048059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1897048059} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1897048059, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1897048059, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1897048059|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 00:14:32,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1002204110 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1002204110 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1002204110 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1002204110 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out1002204110| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1002204110 |P2Thread1of1ForFork0_#t~ite12_Out1002204110|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1002204110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1002204110, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1002204110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1002204110} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1002204110, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1002204110, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1002204110|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1002204110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1002204110} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 00:14:32,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1382179716 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1382179716 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1382179716 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1382179716 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1382179716 |P1Thread1of1ForFork2_#t~ite6_Out1382179716|)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out1382179716| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1382179716, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1382179716, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1382179716, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1382179716} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1382179716, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1382179716, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1382179716, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1382179716|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1382179716} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 00:14:32,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-928782295 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-928782295 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out-928782295| ~y$r_buff0_thd2~0_In-928782295) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out-928782295| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-928782295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-928782295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-928782295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-928782295, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-928782295|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 00:14:32,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In697168682 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In697168682 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In697168682 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In697168682 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite8_Out697168682| 0)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In697168682 |P1Thread1of1ForFork2_#t~ite8_Out697168682|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In697168682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In697168682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In697168682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In697168682} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In697168682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In697168682, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out697168682|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In697168682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In697168682} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 00:14:32,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_103) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_103, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 00:14:32,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1604468624 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1604468624 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out-1604468624) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1604468624 ~y$r_buff0_thd3~0_Out-1604468624) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1604468624, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1604468624} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1604468624, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1604468624, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1604468624|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 00:14:32,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In133526074 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In133526074 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In133526074 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In133526074 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In133526074 |P2Thread1of1ForFork0_#t~ite14_Out133526074|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out133526074|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In133526074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In133526074, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In133526074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In133526074} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out133526074|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In133526074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In133526074, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In133526074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In133526074} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 00:14:32,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L783-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_26| v_~y$r_buff1_thd3~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_99, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 00:14:32,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [614] [614] L806-1-->L812: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:14:32,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In897568364 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out897568364| |ULTIMATE.start_main_#t~ite18_Out897568364|)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In897568364 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out897568364| ~y~0_In897568364) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite18_Out897568364| ~y$w_buff1~0_In897568364) .cse2 (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In897568364, ~y~0=~y~0_In897568364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In897568364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897568364} OutVars{~y$w_buff1~0=~y$w_buff1~0_In897568364, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out897568364|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out897568364|, ~y~0=~y~0_In897568364, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In897568364, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897568364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:14:32,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1326192001 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1326192001 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1326192001| ~y$w_buff0_used~0_In1326192001)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1326192001| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1326192001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326192001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1326192001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1326192001, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1326192001|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:14:32,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-206880234 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-206880234 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-206880234 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-206880234 256) 0))) (or (and (= ~y$w_buff1_used~0_In-206880234 |ULTIMATE.start_main_#t~ite21_Out-206880234|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out-206880234| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206880234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206880234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-206880234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-206880234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206880234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206880234, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-206880234|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-206880234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-206880234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:14:32,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-761499243 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-761499243 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-761499243|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-761499243| ~y$r_buff0_thd0~0_In-761499243)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-761499243, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761499243} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-761499243, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-761499243, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-761499243|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:14:32,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1598372066 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1598372066 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1598372066 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1598372066 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1598372066|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1598372066 |ULTIMATE.start_main_#t~ite23_Out-1598372066|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598372066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1598372066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1598372066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598372066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598372066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1598372066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1598372066, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1598372066|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598372066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 00:14:32,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2068831924 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-2068831924| ~y$w_buff1_used~0_In-2068831924) (= |ULTIMATE.start_main_#t~ite38_In-2068831924| |ULTIMATE.start_main_#t~ite38_Out-2068831924|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-2068831924| ~y$w_buff1_used~0_In-2068831924) (= |ULTIMATE.start_main_#t~ite39_Out-2068831924| |ULTIMATE.start_main_#t~ite38_Out-2068831924|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2068831924 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-2068831924 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-2068831924 256) 0) (and (= (mod ~y$w_buff1_used~0_In-2068831924 256) 0) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068831924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2068831924, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-2068831924|, ~weak$$choice2~0=~weak$$choice2~0_In-2068831924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2068831924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068831924} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068831924, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2068831924|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2068831924, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2068831924|, ~weak$$choice2~0=~weak$$choice2~0_In-2068831924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2068831924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068831924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 00:14:32,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L828-->L829: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 00:14:32,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L831-->L4: Formula: (and (= v_~y~0_99 v_~y$mem_tmp~0_10) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_99, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:14:32,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:14:32,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:14:32 BasicIcfg [2019-12-27 00:14:32,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:14:32,214 INFO L168 Benchmark]: Toolchain (without parser) took 17624.96 ms. Allocated memory was 146.8 MB in the beginning and 804.8 MB in the end (delta: 658.0 MB). Free memory was 102.7 MB in the beginning and 223.4 MB in the end (delta: -120.7 MB). Peak memory consumption was 537.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,215 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.59 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 158.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,218 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,218 INFO L168 Benchmark]: RCFGBuilder took 770.33 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 106.3 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,219 INFO L168 Benchmark]: TraceAbstraction took 15929.17 ms. Allocated memory was 203.9 MB in the beginning and 804.8 MB in the end (delta: 600.8 MB). Free memory was 105.7 MB in the beginning and 223.4 MB in the end (delta: -117.7 MB). Peak memory consumption was 483.1 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:32,223 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.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.59 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 158.1 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.33 ms. Allocated memory is still 203.9 MB. Free memory was 152.3 MB in the beginning and 106.3 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15929.17 ms. Allocated memory was 203.9 MB in the beginning and 804.8 MB in the end (delta: 600.8 MB). Free memory was 105.7 MB in the beginning and 223.4 MB in the end (delta: -117.7 MB). Peak memory consumption was 483.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 94 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 24 ChoiceCompositions, 4225 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 61 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48124 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L770] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L771] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L772] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L773] 3 y$r_buff0_thd3 = (_Bool)1 [L776] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L744] 2 x = 1 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L779] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L780] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L812] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L813] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 0 y$flush_delayed = weak$$choice2 [L822] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1377 SDtfs, 1283 SDslu, 3393 SDs, 0 SdLazy, 1551 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22206occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 3001 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 118699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...