/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:13:50,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:13:50,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:13:50,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:13:50,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:13:50,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:13:50,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:13:50,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:13:50,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:13:50,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:13:50,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:13:50,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:13:50,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:13:50,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:13:50,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:13:50,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:13:50,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:13:50,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:13:50,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:13:50,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:13:50,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:13:50,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:13:50,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:13:50,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:13:50,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:13:50,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:13:50,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:13:50,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:13:50,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:13:50,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:13:50,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:13:50,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:13:50,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:13:50,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:13:50,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:13:50,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:13:50,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:13:50,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:13:50,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:13:50,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:13:50,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:13:50,243 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:13:50,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:13:50,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:13:50,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:13:50,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:13:50,265 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:13:50,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:13:50,266 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:13:50,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:13:50,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:13:50,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:13:50,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:13:50,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:13:50,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:13:50,268 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:13:50,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:13:50,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:13:50,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:13:50,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:13:50,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:13:50,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:13:50,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:13:50,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:13:50,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:13:50,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:13:50,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:13:50,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:13:50,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:13:50,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:13:50,272 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:13:50,272 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:13:50,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:13:50,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:13:50,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:13:50,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:13:50,600 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:13:50,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-27 00:13:50,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2fac87b/f8a76bb57243404da0f0fc3ff4668489/FLAG1f31bd6fa [2019-12-27 00:13:51,265 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:13:51,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2019-12-27 00:13:51,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2fac87b/f8a76bb57243404da0f0fc3ff4668489/FLAG1f31bd6fa [2019-12-27 00:13:51,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2fac87b/f8a76bb57243404da0f0fc3ff4668489 [2019-12-27 00:13:51,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:13:51,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:13:51,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:51,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:13:51,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:13:51,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:51" (1/1) ... [2019-12-27 00:13:51,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1477f632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:51, skipping insertion in model container [2019-12-27 00:13:51,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:13:51" (1/1) ... [2019-12-27 00:13:51,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:13:51,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:13:52,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:52,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:13:52,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:13:52,279 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:13:52,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52 WrapperNode [2019-12-27 00:13:52,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:13:52,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:52,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:13:52,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:13:52,290 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:13:52" (1/1) ... [2019-12-27 00:13:52,314 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:13:52" (1/1) ... [2019-12-27 00:13:52,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:13:52,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:13:52,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:13:52,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:13:52,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (1/1) ... [2019-12-27 00:13:52,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:13:52,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:13:52,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:13:52,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:13:52,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (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:13:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:13:52,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:13:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:13:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:13:52,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:13:52,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:13:52,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:13:52,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:13:52,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:13:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:13:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:13:52,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:13:52,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:13:52,475 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:13:53,205 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:13:53,205 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:13:53,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:53 BoogieIcfgContainer [2019-12-27 00:13:53,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:13:53,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:13:53,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:13:53,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:13:53,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:13:51" (1/3) ... [2019-12-27 00:13:53,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d754a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:53, skipping insertion in model container [2019-12-27 00:13:53,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:13:52" (2/3) ... [2019-12-27 00:13:53,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d754a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:13:53, skipping insertion in model container [2019-12-27 00:13:53,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:13:53" (3/3) ... [2019-12-27 00:13:53,219 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2019-12-27 00:13:53,227 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:13:53,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:13:53,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:13:53,236 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:13:53,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,274 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,275 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,276 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,297 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,298 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:13:53,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:13:53,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:13:53,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:13:53,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:13:53,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:13:53,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:13:53,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:13:53,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:13:53,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:13:53,373 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 00:13:53,375 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:13:53,494 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:13:53,494 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:53,510 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:13:53,530 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 00:13:53,611 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 00:13:53,611 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:13:53,619 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:13:53,632 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 00:13:53,634 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:13:58,491 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 00:13:58,605 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 00:13:58,629 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48124 [2019-12-27 00:13:58,629 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 00:13:58,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 94 transitions [2019-12-27 00:13:59,525 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15710 states. [2019-12-27 00:13:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states. [2019-12-27 00:13:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:13:59,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:13:59,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:13:59,534 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:13:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:13:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2126234855, now seen corresponding path program 1 times [2019-12-27 00:13:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:13:59,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141841228] [2019-12-27 00:13:59,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:13:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:13:59,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:13:59,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141841228] [2019-12-27 00:13:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:13:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:13:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921412386] [2019-12-27 00:13:59,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:13:59,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:13:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:13:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:13:59,802 INFO L87 Difference]: Start difference. First operand 15710 states. Second operand 3 states. [2019-12-27 00:14:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:00,339 INFO L93 Difference]: Finished difference Result 15638 states and 59348 transitions. [2019-12-27 00:14:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:00,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 00:14:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:00,550 INFO L225 Difference]: With dead ends: 15638 [2019-12-27 00:14:00,550 INFO L226 Difference]: Without dead ends: 15326 [2019-12-27 00:14:00,552 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:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15326 states. [2019-12-27 00:14:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15326 to 15326. [2019-12-27 00:14:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15326 states. [2019-12-27 00:14:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15326 states to 15326 states and 58230 transitions. [2019-12-27 00:14:01,922 INFO L78 Accepts]: Start accepts. Automaton has 15326 states and 58230 transitions. Word has length 7 [2019-12-27 00:14:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:01,923 INFO L462 AbstractCegarLoop]: Abstraction has 15326 states and 58230 transitions. [2019-12-27 00:14:01,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 15326 states and 58230 transitions. [2019-12-27 00:14:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:01,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:01,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:01,934 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:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -380072381, now seen corresponding path program 1 times [2019-12-27 00:14:01,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388198240] [2019-12-27 00:14:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:02,106 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:02,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388198240] [2019-12-27 00:14:02,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:02,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:02,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538839347] [2019-12-27 00:14:02,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:02,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:02,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:02,111 INFO L87 Difference]: Start difference. First operand 15326 states and 58230 transitions. Second operand 4 states. [2019-12-27 00:14:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:02,850 INFO L93 Difference]: Finished difference Result 24490 states and 89350 transitions. [2019-12-27 00:14:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:02,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:14:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:02,967 INFO L225 Difference]: With dead ends: 24490 [2019-12-27 00:14:02,967 INFO L226 Difference]: Without dead ends: 24476 [2019-12-27 00:14:02,968 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:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-12-27 00:14:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 22206. [2019-12-27 00:14:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22206 states. [2019-12-27 00:14:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22206 states to 22206 states and 82052 transitions. [2019-12-27 00:14:05,327 INFO L78 Accepts]: Start accepts. Automaton has 22206 states and 82052 transitions. Word has length 13 [2019-12-27 00:14:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:05,327 INFO L462 AbstractCegarLoop]: Abstraction has 22206 states and 82052 transitions. [2019-12-27 00:14:05,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 22206 states and 82052 transitions. [2019-12-27 00:14:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:14:05,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:05,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:05,331 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:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 691839138, now seen corresponding path program 1 times [2019-12-27 00:14:05,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:05,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858615306] [2019-12-27 00:14:05,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:05,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858615306] [2019-12-27 00:14:05,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:05,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:05,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923830509] [2019-12-27 00:14:05,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:05,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:05,392 INFO L87 Difference]: Start difference. First operand 22206 states and 82052 transitions. Second operand 3 states. [2019-12-27 00:14:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:05,459 INFO L93 Difference]: Finished difference Result 12702 states and 40687 transitions. [2019-12-27 00:14:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:05,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 00:14:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:05,501 INFO L225 Difference]: With dead ends: 12702 [2019-12-27 00:14:05,501 INFO L226 Difference]: Without dead ends: 12702 [2019-12-27 00:14:05,501 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:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-27 00:14:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12702. [2019-12-27 00:14:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12702 states. [2019-12-27 00:14:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 40687 transitions. [2019-12-27 00:14:05,852 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 40687 transitions. Word has length 13 [2019-12-27 00:14:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:05,853 INFO L462 AbstractCegarLoop]: Abstraction has 12702 states and 40687 transitions. [2019-12-27 00:14:05,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 40687 transitions. [2019-12-27 00:14:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:14:05,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:05,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:05,855 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:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1718037058, now seen corresponding path program 1 times [2019-12-27 00:14:05,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:05,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567198100] [2019-12-27 00:14:05,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:05,912 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:05,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567198100] [2019-12-27 00:14:05,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:05,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:05,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166861977] [2019-12-27 00:14:05,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:14:05,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:05,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:14:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:14:05,918 INFO L87 Difference]: Start difference. First operand 12702 states and 40687 transitions. Second operand 4 states. [2019-12-27 00:14:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:05,951 INFO L93 Difference]: Finished difference Result 1935 states and 4569 transitions. [2019-12-27 00:14:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:14:05,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:14:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:05,957 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 00:14:05,958 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 00:14:05,958 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:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 00:14:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 00:14:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 00:14:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4569 transitions. [2019-12-27 00:14:05,991 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4569 transitions. Word has length 14 [2019-12-27 00:14:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:05,991 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4569 transitions. [2019-12-27 00:14:05,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:14:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4569 transitions. [2019-12-27 00:14:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:14:05,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:05,994 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:05,994 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:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash 968226525, now seen corresponding path program 1 times [2019-12-27 00:14:05,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:05,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457212824] [2019-12-27 00:14:05,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:06,110 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:06,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457212824] [2019-12-27 00:14:06,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:06,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:14:06,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197231333] [2019-12-27 00:14:06,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:14:06,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:14:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:14:06,112 INFO L87 Difference]: Start difference. First operand 1935 states and 4569 transitions. Second operand 5 states. [2019-12-27 00:14:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:06,136 INFO L93 Difference]: Finished difference Result 630 states and 1476 transitions. [2019-12-27 00:14:06,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:14:06,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 00:14:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:06,138 INFO L225 Difference]: With dead ends: 630 [2019-12-27 00:14:06,140 INFO L226 Difference]: Without dead ends: 630 [2019-12-27 00:14:06,141 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:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-12-27 00:14:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 574. [2019-12-27 00:14:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-27 00:14:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2019-12-27 00:14:06,151 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 26 [2019-12-27 00:14:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:06,152 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2019-12-27 00:14:06,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:14:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2019-12-27 00:14:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:06,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:06,155 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:06,155 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:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash 196092715, now seen corresponding path program 1 times [2019-12-27 00:14:06,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:06,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76112087] [2019-12-27 00:14:06,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:06,216 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:06,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76112087] [2019-12-27 00:14:06,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:06,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:14:06,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249761837] [2019-12-27 00:14:06,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:06,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:06,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:06,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:06,218 INFO L87 Difference]: Start difference. First operand 574 states and 1344 transitions. Second operand 3 states. [2019-12-27 00:14:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:06,269 INFO L93 Difference]: Finished difference Result 584 states and 1354 transitions. [2019-12-27 00:14:06,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:06,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:14:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:06,272 INFO L225 Difference]: With dead ends: 584 [2019-12-27 00:14:06,272 INFO L226 Difference]: Without dead ends: 584 [2019-12-27 00:14:06,273 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:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-12-27 00:14:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-12-27 00:14:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-27 00:14:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1350 transitions. [2019-12-27 00:14:06,283 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1350 transitions. Word has length 55 [2019-12-27 00:14:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:06,283 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 1350 transitions. [2019-12-27 00:14:06,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1350 transitions. [2019-12-27 00:14:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:06,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:06,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:06,287 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:06,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash -922835002, now seen corresponding path program 1 times [2019-12-27 00:14:06,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:06,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888178059] [2019-12-27 00:14:06,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:06,441 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:06,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888178059] [2019-12-27 00:14:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:06,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:14:06,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062819871] [2019-12-27 00:14:06,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:06,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:06,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:06,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:06,443 INFO L87 Difference]: Start difference. First operand 580 states and 1350 transitions. Second operand 6 states. [2019-12-27 00:14:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:06,904 INFO L93 Difference]: Finished difference Result 933 states and 2172 transitions. [2019-12-27 00:14:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:14:06,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 00:14:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:06,906 INFO L225 Difference]: With dead ends: 933 [2019-12-27 00:14:06,906 INFO L226 Difference]: Without dead ends: 933 [2019-12-27 00:14:06,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:14:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-27 00:14:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 738. [2019-12-27 00:14:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 00:14:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1733 transitions. [2019-12-27 00:14:06,920 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1733 transitions. Word has length 55 [2019-12-27 00:14:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:06,921 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1733 transitions. [2019-12-27 00:14:06,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1733 transitions. [2019-12-27 00:14:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:06,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:06,923 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:06,923 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:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:06,924 INFO L82 PathProgramCache]: Analyzing trace with hash -256459022, now seen corresponding path program 2 times [2019-12-27 00:14:06,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:06,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133693453] [2019-12-27 00:14:06,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:07,084 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:07,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133693453] [2019-12-27 00:14:07,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:07,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:14:07,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189278008] [2019-12-27 00:14:07,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:07,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:07,086 INFO L87 Difference]: Start difference. First operand 738 states and 1733 transitions. Second operand 6 states. [2019-12-27 00:14:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:07,466 INFO L93 Difference]: Finished difference Result 1275 states and 2967 transitions. [2019-12-27 00:14:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:14:07,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 00:14:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:07,470 INFO L225 Difference]: With dead ends: 1275 [2019-12-27 00:14:07,470 INFO L226 Difference]: Without dead ends: 1275 [2019-12-27 00:14:07,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:14:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-27 00:14:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 816. [2019-12-27 00:14:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-27 00:14:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1930 transitions. [2019-12-27 00:14:07,492 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1930 transitions. Word has length 55 [2019-12-27 00:14:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:07,492 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1930 transitions. [2019-12-27 00:14:07,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1930 transitions. [2019-12-27 00:14:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 00:14:07,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:07,496 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:07,496 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:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash -198491454, now seen corresponding path program 3 times [2019-12-27 00:14:07,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:07,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290447002] [2019-12-27 00:14:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:07,600 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:07,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290447002] [2019-12-27 00:14:07,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:07,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:07,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203132020] [2019-12-27 00:14:07,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:07,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:07,603 INFO L87 Difference]: Start difference. First operand 816 states and 1930 transitions. Second operand 3 states. [2019-12-27 00:14:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:07,618 INFO L93 Difference]: Finished difference Result 738 states and 1703 transitions. [2019-12-27 00:14:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:07,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 00:14:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:07,619 INFO L225 Difference]: With dead ends: 738 [2019-12-27 00:14:07,620 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 00:14:07,620 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:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 00:14:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-27 00:14:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 00:14:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1703 transitions. [2019-12-27 00:14:07,632 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1703 transitions. Word has length 55 [2019-12-27 00:14:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:07,633 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1703 transitions. [2019-12-27 00:14:07,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1703 transitions. [2019-12-27 00:14:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:07,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:07,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:07,636 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:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1314270907, now seen corresponding path program 1 times [2019-12-27 00:14:07,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:07,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399062349] [2019-12-27 00:14:07,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:07,890 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:07,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399062349] [2019-12-27 00:14:07,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:07,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 00:14:07,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149090556] [2019-12-27 00:14:07,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:14:07,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:14:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:14:07,892 INFO L87 Difference]: Start difference. First operand 738 states and 1703 transitions. Second operand 9 states. [2019-12-27 00:14:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:08,429 INFO L93 Difference]: Finished difference Result 1118 states and 2536 transitions. [2019-12-27 00:14:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:14:08,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 00:14:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:08,431 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 00:14:08,431 INFO L226 Difference]: Without dead ends: 1118 [2019-12-27 00:14:08,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:14:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-27 00:14:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 670. [2019-12-27 00:14:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 00:14:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1537 transitions. [2019-12-27 00:14:08,446 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1537 transitions. Word has length 56 [2019-12-27 00:14:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:08,447 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1537 transitions. [2019-12-27 00:14:08,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:14:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1537 transitions. [2019-12-27 00:14:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 00:14:08,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:08,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:14:08,450 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:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 69556479, now seen corresponding path program 2 times [2019-12-27 00:14:08,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:08,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957278100] [2019-12-27 00:14:08,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:08,573 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:08,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957278100] [2019-12-27 00:14:08,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:08,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:14:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283107990] [2019-12-27 00:14:08,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:14:08,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:14:08,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:14:08,578 INFO L87 Difference]: Start difference. First operand 670 states and 1537 transitions. Second operand 3 states. [2019-12-27 00:14:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:08,629 INFO L93 Difference]: Finished difference Result 670 states and 1536 transitions. [2019-12-27 00:14:08,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:14:08,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 00:14:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:08,631 INFO L225 Difference]: With dead ends: 670 [2019-12-27 00:14:08,631 INFO L226 Difference]: Without dead ends: 670 [2019-12-27 00:14:08,631 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:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-27 00:14:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 491. [2019-12-27 00:14:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-12-27 00:14:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1113 transitions. [2019-12-27 00:14:08,645 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1113 transitions. Word has length 56 [2019-12-27 00:14:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:08,646 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 1113 transitions. [2019-12-27 00:14:08,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:14:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1113 transitions. [2019-12-27 00:14:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:08,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:08,648 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:08,649 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:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 700007354, now seen corresponding path program 1 times [2019-12-27 00:14:08,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:08,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019868731] [2019-12-27 00:14:08,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:14:08,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019868731] [2019-12-27 00:14:08,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:08,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:14:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29200250] [2019-12-27 00:14:08,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:08,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:08,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:08,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:08,844 INFO L87 Difference]: Start difference. First operand 491 states and 1113 transitions. Second operand 6 states. [2019-12-27 00:14:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:08,914 INFO L93 Difference]: Finished difference Result 731 states and 1538 transitions. [2019-12-27 00:14:08,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:14:08,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 00:14:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:08,917 INFO L225 Difference]: With dead ends: 731 [2019-12-27 00:14:08,917 INFO L226 Difference]: Without dead ends: 452 [2019-12-27 00:14:08,917 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:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-12-27 00:14:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 422. [2019-12-27 00:14:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 00:14:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 914 transitions. [2019-12-27 00:14:08,924 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 914 transitions. Word has length 57 [2019-12-27 00:14:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:08,925 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 914 transitions. [2019-12-27 00:14:08,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 914 transitions. [2019-12-27 00:14:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:08,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:08,926 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:08,927 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:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:08,927 INFO L82 PathProgramCache]: Analyzing trace with hash 574299964, now seen corresponding path program 2 times [2019-12-27 00:14:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:08,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850317532] [2019-12-27 00:14:08,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:09,102 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:09,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850317532] [2019-12-27 00:14:09,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:09,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:14:09,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718841510] [2019-12-27 00:14:09,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:14:09,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:14:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:14:09,105 INFO L87 Difference]: Start difference. First operand 422 states and 914 transitions. Second operand 6 states. [2019-12-27 00:14:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:09,181 INFO L93 Difference]: Finished difference Result 595 states and 1211 transitions. [2019-12-27 00:14:09,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:14:09,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 00:14:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:09,182 INFO L225 Difference]: With dead ends: 595 [2019-12-27 00:14:09,182 INFO L226 Difference]: Without dead ends: 202 [2019-12-27 00:14:09,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:14:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-27 00:14:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-12-27 00:14:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-27 00:14:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 344 transitions. [2019-12-27 00:14:09,191 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 344 transitions. Word has length 57 [2019-12-27 00:14:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 344 transitions. [2019-12-27 00:14:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:14:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 344 transitions. [2019-12-27 00:14:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:09,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:09,192 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:09,192 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:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -431408076, now seen corresponding path program 3 times [2019-12-27 00:14:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:09,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581572439] [2019-12-27 00:14:09,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:09,473 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:09,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581572439] [2019-12-27 00:14:09,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:09,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:14:09,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539782752] [2019-12-27 00:14:09,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:14:09,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:14:09,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:14:09,476 INFO L87 Difference]: Start difference. First operand 202 states and 344 transitions. Second operand 13 states. [2019-12-27 00:14:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:09,942 INFO L93 Difference]: Finished difference Result 369 states and 619 transitions. [2019-12-27 00:14:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:14:09,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 00:14:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:09,944 INFO L225 Difference]: With dead ends: 369 [2019-12-27 00:14:09,944 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 00:14:09,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 00:14:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 00:14:09,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 302. [2019-12-27 00:14:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-12-27 00:14:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 515 transitions. [2019-12-27 00:14:09,951 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 515 transitions. Word has length 57 [2019-12-27 00:14:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:09,952 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 515 transitions. [2019-12-27 00:14:09,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:14:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 515 transitions. [2019-12-27 00:14:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:09,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:09,953 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:09,953 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:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1239613688, now seen corresponding path program 4 times [2019-12-27 00:14:09,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:09,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465558437] [2019-12-27 00:14:09,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:14:10,194 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:10,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465558437] [2019-12-27 00:14:10,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:14:10,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:14:10,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658795270] [2019-12-27 00:14:10,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:14:10,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:14:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:14:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:14:10,196 INFO L87 Difference]: Start difference. First operand 302 states and 515 transitions. Second operand 13 states. [2019-12-27 00:14:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:14:10,693 INFO L93 Difference]: Finished difference Result 407 states and 673 transitions. [2019-12-27 00:14:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 00:14:10,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 00:14:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:14:10,695 INFO L225 Difference]: With dead ends: 407 [2019-12-27 00:14:10,695 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 00:14:10,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-27 00:14:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 00:14:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 310. [2019-12-27 00:14:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-27 00:14:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 529 transitions. [2019-12-27 00:14:10,702 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 529 transitions. Word has length 57 [2019-12-27 00:14:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:14:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 529 transitions. [2019-12-27 00:14:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:14:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 529 transitions. [2019-12-27 00:14:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:14:10,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:14:10,704 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:10,704 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:14:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:14:10,705 INFO L82 PathProgramCache]: Analyzing trace with hash -97225810, now seen corresponding path program 5 times [2019-12-27 00:14:10,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:14:10,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299214204] [2019-12-27 00:14:10,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:14:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:14:10,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:14:10,803 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:14:10,807 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) (= 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) (= 0 v_~y$w_buff0~0_215) (= 0 |v_ULTIMATE.start_main_~#t2522~0.offset_17|) (= 0 v_~y$r_buff0_thd3~0_201) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd0~0_331 0) (= v_~y$r_buff0_thd1~0_37 0) (= v_~y$w_buff0_used~0_623 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22| 1)) (= 0 |v_#NULL.base_4|) (= v_~y~0_147 0) (= 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) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2522~0.base_22| 4) |v_#length_21|) (= 0 v_~y$r_buff1_thd3~0_162) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2522~0.base_22|)) (= v_~z~0_148 0) (= 0 v_~__unbuffered_cnt~0_97) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2522~0.base_22|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2522~0.base_22|) |v_ULTIMATE.start_main_~#t2522~0.offset_17| 0)) |v_#memory_int_19|) (= 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, ULTIMATE.start_main_~#t2522~0.base=|v_ULTIMATE.start_main_~#t2522~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_37, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ULTIMATE.start_main_~#t2522~0.offset=|v_ULTIMATE.start_main_~#t2522~0.offset_17|, #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, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_15|, ~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_#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_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_15|, 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|, ~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, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_18|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_19|, 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|, ~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_#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, ~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, ULTIMATE.start_main_~#t2522~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2522~0.offset, #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, ULTIMATE.start_main_~#t2524~0.offset, ~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_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t2523~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2524~0.base, ~y~0, ULTIMATE.start_main_~#t2523~0.base, 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, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:14:10,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2523~0.base_11|) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11| 1) |v_#valid_33|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2523~0.base_11|) |v_ULTIMATE.start_main_~#t2523~0.offset_10| 1)) |v_#memory_int_15|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2523~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t2523~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2523~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2523~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2523~0.base=|v_ULTIMATE.start_main_~#t2523~0.base_11|, #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_~#t2523~0.offset=|v_ULTIMATE.start_main_~#t2523~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2523~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2523~0.offset] because there is no mapped edge [2019-12-27 00:14:10,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L804-1-->L806: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2524~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2524~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2524~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2524~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2524~0.base_10| 0)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2524~0.base_10|) |v_ULTIMATE.start_main_~#t2524~0.offset_10| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2524~0.base=|v_ULTIMATE.start_main_~#t2524~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2524~0.offset=|v_ULTIMATE.start_main_~#t2524~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2524~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2524~0.offset] because there is no mapped edge [2019-12-27 00:14:10,811 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:10,812 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:10,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2141111179 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2141111179 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out2141111179| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out2141111179| ~y$w_buff0_used~0_In2141111179)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2141111179, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2141111179} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2141111179, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2141111179|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2141111179} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 00:14:10,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L750-2-->L750-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1283043215| |P1Thread1of1ForFork2_#t~ite3_Out-1283043215|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1283043215 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1283043215 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-1283043215| ~y$w_buff1~0_In-1283043215) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1283043215| ~y~0_In-1283043215) .cse2 (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1283043215, ~y$w_buff1~0=~y$w_buff1~0_In-1283043215, ~y~0=~y~0_In-1283043215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1283043215} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1283043215, ~y$w_buff1~0=~y$w_buff1~0_In-1283043215, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1283043215|, ~y~0=~y~0_In-1283043215, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1283043215|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1283043215} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 00:14:10,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-555780603 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-555780603 256)))) (or (and (= ~y$w_buff0_used~0_In-555780603 |P1Thread1of1ForFork2_#t~ite5_Out-555780603|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-555780603|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-555780603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-555780603} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-555780603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-555780603, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-555780603|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 00:14:10,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-786259403 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-786259403 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-786259403 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-786259403 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-786259403|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-786259403 |P2Thread1of1ForFork0_#t~ite12_Out-786259403|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-786259403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-786259403, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-786259403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786259403} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-786259403, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-786259403, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-786259403|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-786259403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786259403} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 00:14:10,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1059309894 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1059309894 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1059309894 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1059309894 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1059309894 |P1Thread1of1ForFork2_#t~ite6_Out1059309894|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out1059309894|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059309894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1059309894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1059309894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059309894} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1059309894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1059309894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1059309894, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1059309894|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059309894} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 00:14:10,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1814590569 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1814590569 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1814590569|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-1814590569 |P1Thread1of1ForFork2_#t~ite7_Out-1814590569|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814590569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1814590569} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1814590569, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1814590569, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1814590569|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 00:14:10,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1496996270 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1496996270 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1496996270 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1496996270 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1496996270|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In1496996270 |P1Thread1of1ForFork2_#t~ite8_Out1496996270|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496996270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496996270, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496996270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496996270} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496996270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496996270, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1496996270|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496996270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496996270} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 00:14:10,821 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:10,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In169289316 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In169289316 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out169289316)) (and (= ~y$r_buff0_thd3~0_In169289316 ~y$r_buff0_thd3~0_Out169289316) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In169289316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In169289316} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In169289316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out169289316, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out169289316|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 00:14:10,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1772676785 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1772676785 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1772676785 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1772676785 256)))) (or (and (= ~y$r_buff1_thd3~0_In-1772676785 |P2Thread1of1ForFork0_#t~ite14_Out-1772676785|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite14_Out-1772676785| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1772676785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772676785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1772676785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772676785} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1772676785|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1772676785, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772676785, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1772676785, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772676785} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 00:14:10,822 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:10,823 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:10,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L812-2-->L812-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1482584850 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1482584850 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1482584850| |ULTIMATE.start_main_#t~ite19_Out1482584850|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1482584850| ~y~0_In1482584850) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In1482584850 |ULTIMATE.start_main_#t~ite18_Out1482584850|) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1482584850, ~y~0=~y~0_In1482584850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482584850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482584850} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1482584850, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1482584850|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1482584850|, ~y~0=~y~0_In1482584850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1482584850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482584850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 00:14:10,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In374390986 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In374390986 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out374390986| ~y$w_buff0_used~0_In374390986)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out374390986| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In374390986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In374390986} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In374390986, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In374390986, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out374390986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 00:14:10,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1833347901 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1833347901 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1833347901 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1833347901 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1833347901| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite21_Out-1833347901| ~y$w_buff1_used~0_In-1833347901) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833347901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1833347901, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1833347901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1833347901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833347901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1833347901, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1833347901|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1833347901, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1833347901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 00:14:10,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-80092699 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-80092699 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-80092699| ~y$r_buff0_thd0~0_In-80092699)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-80092699| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-80092699, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-80092699} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-80092699, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-80092699, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-80092699|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 00:14:10,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1735013765 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1735013765 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1735013765 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1735013765 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1735013765 |ULTIMATE.start_main_#t~ite23_Out1735013765|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1735013765|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1735013765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735013765, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735013765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735013765} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1735013765, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735013765, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1735013765, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1735013765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735013765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 00:14:10,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L827-->L827-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-894889891 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-894889891| ~y$w_buff1_used~0_In-894889891) (= |ULTIMATE.start_main_#t~ite38_In-894889891| |ULTIMATE.start_main_#t~ite38_Out-894889891|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-894889891| ~y$w_buff1_used~0_In-894889891) (= |ULTIMATE.start_main_#t~ite38_Out-894889891| |ULTIMATE.start_main_#t~ite39_Out-894889891|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-894889891 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-894889891 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-894889891 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-894889891 256))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-894889891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-894889891, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-894889891|, ~weak$$choice2~0=~weak$$choice2~0_In-894889891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-894889891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-894889891} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-894889891, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-894889891|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-894889891, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-894889891|, ~weak$$choice2~0=~weak$$choice2~0_In-894889891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-894889891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-894889891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 00:14:10,834 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:10,836 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:10,837 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:10,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:14:10 BasicIcfg [2019-12-27 00:14:10,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:14:10,935 INFO L168 Benchmark]: Toolchain (without parser) took 19386.16 ms. Allocated memory was 137.9 MB in the beginning and 868.7 MB in the end (delta: 730.9 MB). Free memory was 100.8 MB in the beginning and 294.9 MB in the end (delta: -194.1 MB). Peak memory consumption was 536.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,935 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:14:10,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.04 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,937 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.33 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,942 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,943 INFO L168 Benchmark]: RCFGBuilder took 802.95 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 103.5 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,944 INFO L168 Benchmark]: TraceAbstraction took 17721.16 ms. Allocated memory was 201.9 MB in the beginning and 868.7 MB in the end (delta: 666.9 MB). Free memory was 103.5 MB in the beginning and 294.9 MB in the end (delta: -191.3 MB). Peak memory consumption was 475.6 MB. Max. memory is 7.1 GB. [2019-12-27 00:14:10,951 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.50 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.04 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.33 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.95 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 103.5 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17721.16 ms. Allocated memory was 201.9 MB in the beginning and 868.7 MB in the end (delta: 666.9 MB). Free memory was 103.5 MB in the beginning and 294.9 MB in the end (delta: -191.3 MB). Peak memory consumption was 475.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 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.4s, 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(&t2522, ((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(&t2523, ((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(&t2524, ((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: 17.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1513 SDtfs, 1383 SDslu, 3785 SDs, 0 SdLazy, 1935 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s 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: 4.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 3737 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 119830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...