/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/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:58:58,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:58:58,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:58:58,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:58:58,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:58:58,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:58:58,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:58:58,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:58:58,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:58:58,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:58:58,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:58:58,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:58:58,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:58:58,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:58:58,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:58:58,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:58:58,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:58:58,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:58:58,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:58:58,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:58:58,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:58:58,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:58:58,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:58:58,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:58:58,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:58:58,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:58:58,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:58:58,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:58:58,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:58:58,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:58:58,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:58:58,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:58:58,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:58:58,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:58:58,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:58:58,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:58:58,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:58:58,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:58:58,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:58:58,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:58:58,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:58:58,257 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-18 13:58:58,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:58:58,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:58:58,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:58:58,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:58:58,278 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:58:58,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:58:58,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:58:58,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:58:58,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:58:58,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:58:58,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:58:58,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:58:58,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:58:58,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:58:58,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:58:58,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:58:58,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:58:58,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:58:58,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:58:58,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:58:58,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:58:58,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:58:58,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:58:58,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:58:58,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:58:58,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:58:58,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:58:58,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:58:58,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:58:58,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:58:58,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:58:58,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:58:58,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:58:58,576 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:58:58,576 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:58:58,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 13:58:58,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b14e04/60b1a51e91b341a68dc9ae8fc6f4dc2c/FLAG8223762dd [2019-12-18 13:58:59,171 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:58:59,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-18 13:58:59,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b14e04/60b1a51e91b341a68dc9ae8fc6f4dc2c/FLAG8223762dd [2019-12-18 13:58:59,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708b14e04/60b1a51e91b341a68dc9ae8fc6f4dc2c [2019-12-18 13:58:59,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:58:59,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:58:59,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:58:59,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:58:59,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:58:59,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:58:59" (1/1) ... [2019-12-18 13:58:59,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:58:59, skipping insertion in model container [2019-12-18 13:58:59,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:58:59" (1/1) ... [2019-12-18 13:58:59,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:58:59,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:59:00,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:00,177 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:59:00,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:59:00,331 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:59:00,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00 WrapperNode [2019-12-18 13:59:00,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:59:00,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:00,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:59:00,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:59:00,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:59:00,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:59:00,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:59:00,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:59:00,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (1/1) ... [2019-12-18 13:59:00,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:59:00,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:59:00,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:59:00,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:59:00,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (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-18 13:59:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:59:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:59:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:59:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:59:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:59:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:59:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:59:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:59:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:59:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:59:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:59:00,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:59:00,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:59:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:59:00,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:59:00,514 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:59:01,262 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:59:01,262 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:59:01,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:01 BoogieIcfgContainer [2019-12-18 13:59:01,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:59:01,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:59:01,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:59:01,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:59:01,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:58:59" (1/3) ... [2019-12-18 13:59:01,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec67efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:01, skipping insertion in model container [2019-12-18 13:59:01,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:59:00" (2/3) ... [2019-12-18 13:59:01,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec67efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:59:01, skipping insertion in model container [2019-12-18 13:59:01,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:59:01" (3/3) ... [2019-12-18 13:59:01,272 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2019-12-18 13:59:01,283 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:59:01,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:59:01,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:59:01,293 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:59:01,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,332 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,336 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,344 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,345 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,345 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,346 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,346 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,347 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,363 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,364 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,365 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,366 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,367 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,368 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,369 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,370 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,371 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,377 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,377 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,381 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,387 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,387 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,392 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,392 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,393 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,394 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,395 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,396 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,396 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:59:01,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:59:01,439 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:59:01,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:59:01,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:59:01,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:59:01,440 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:59:01,440 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:59:01,440 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:59:01,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:59:01,464 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 13:59:01,465 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:59:01,587 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:59:01,588 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:01,612 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:59:01,633 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:59:01,700 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:59:01,700 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:59:01,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:59:01,721 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:59:01,722 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:59:06,760 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:59:06,894 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:59:06,915 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-18 13:59:06,916 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 13:59:06,919 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-18 13:59:09,148 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 13:59:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 13:59:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:59:09,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:09,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:09,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-18 13:59:09,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:09,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613456237] [2019-12-18 13:59:09,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:09,431 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-18 13:59:09,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613456237] [2019-12-18 13:59:09,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:59:09,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49880981] [2019-12-18 13:59:09,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:09,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:09,457 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 13:59:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:10,728 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-18 13:59:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:59:10,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:59:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:11,021 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 13:59:11,022 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 13:59:11,024 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-18 13:59:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 13:59:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 13:59:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 13:59:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-18 13:59:12,906 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-18 13:59:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:12,908 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-18 13:59:12,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:59:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-18 13:59:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:59:12,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:12,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:12,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-18 13:59:12,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:12,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828897150] [2019-12-18 13:59:12,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:13,026 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-18 13:59:13,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828897150] [2019-12-18 13:59:13,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:13,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:59:13,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113542241] [2019-12-18 13:59:13,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:59:13,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:59:13,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:59:13,030 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-18 13:59:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:15,324 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-18 13:59:15,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:59:15,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:59:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:15,612 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 13:59:15,613 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 13:59:15,614 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-18 13:59:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 13:59:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-18 13:59:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-18 13:59:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-18 13:59:17,700 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-18 13:59:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:17,700 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-18 13:59:17,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:59:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-18 13:59:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:59:17,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:17,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:17,703 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-18 13:59:17,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:17,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553360897] [2019-12-18 13:59:17,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:17,843 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-18 13:59:17,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553360897] [2019-12-18 13:59:17,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:17,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:59:17,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624996717] [2019-12-18 13:59:17,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:59:17,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:59:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:59:17,845 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-18 13:59:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:18,317 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-18 13:59:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:59:18,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:59:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:18,467 INFO L225 Difference]: With dead ends: 58566 [2019-12-18 13:59:18,468 INFO L226 Difference]: Without dead ends: 58566 [2019-12-18 13:59:18,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:59:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-18 13:59:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-18 13:59:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-18 13:59:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-18 13:59:22,171 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-18 13:59:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:22,171 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-18 13:59:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:59:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-18 13:59:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:59:22,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:22,188 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] [2019-12-18 13:59:22,188 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-18 13:59:22,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:22,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959307321] [2019-12-18 13:59:22,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:22,281 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-18 13:59:22,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959307321] [2019-12-18 13:59:22,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:22,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:59:22,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474789443] [2019-12-18 13:59:22,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:59:22,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:59:22,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:59:22,285 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 4 states. [2019-12-18 13:59:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:22,512 INFO L93 Difference]: Finished difference Result 41984 states and 159713 transitions. [2019-12-18 13:59:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:59:22,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 13:59:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:23,093 INFO L225 Difference]: With dead ends: 41984 [2019-12-18 13:59:23,093 INFO L226 Difference]: Without dead ends: 40876 [2019-12-18 13:59:23,094 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-18 13:59:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-12-18 13:59:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 40876. [2019-12-18 13:59:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40876 states. [2019-12-18 13:59:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40876 states to 40876 states and 156237 transitions. [2019-12-18 13:59:26,608 INFO L78 Accepts]: Start accepts. Automaton has 40876 states and 156237 transitions. Word has length 21 [2019-12-18 13:59:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:26,608 INFO L462 AbstractCegarLoop]: Abstraction has 40876 states and 156237 transitions. [2019-12-18 13:59:26,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:59:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 40876 states and 156237 transitions. [2019-12-18 13:59:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:59:26,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:26,622 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] [2019-12-18 13:59:26,622 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 637645513, now seen corresponding path program 1 times [2019-12-18 13:59:26,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:26,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612473547] [2019-12-18 13:59:26,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:26,712 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-18 13:59:26,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612473547] [2019-12-18 13:59:26,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:59:26,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500380115] [2019-12-18 13:59:26,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:59:26,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:59:26,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:59:26,715 INFO L87 Difference]: Start difference. First operand 40876 states and 156237 transitions. Second operand 5 states. [2019-12-18 13:59:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:26,853 INFO L93 Difference]: Finished difference Result 17650 states and 55945 transitions. [2019-12-18 13:59:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:59:26,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:59:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:26,887 INFO L225 Difference]: With dead ends: 17650 [2019-12-18 13:59:26,887 INFO L226 Difference]: Without dead ends: 16774 [2019-12-18 13:59:26,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:59:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2019-12-18 13:59:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 16774. [2019-12-18 13:59:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16774 states. [2019-12-18 13:59:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16774 states to 16774 states and 53147 transitions. [2019-12-18 13:59:27,187 INFO L78 Accepts]: Start accepts. Automaton has 16774 states and 53147 transitions. Word has length 22 [2019-12-18 13:59:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:27,187 INFO L462 AbstractCegarLoop]: Abstraction has 16774 states and 53147 transitions. [2019-12-18 13:59:27,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:59:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 16774 states and 53147 transitions. [2019-12-18 13:59:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:59:27,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:27,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] [2019-12-18 13:59:27,193 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1738609321, now seen corresponding path program 1 times [2019-12-18 13:59:27,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:27,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905543791] [2019-12-18 13:59:27,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:27,277 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-18 13:59:27,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905543791] [2019-12-18 13:59:27,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:27,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:59:27,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378551445] [2019-12-18 13:59:27,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:59:27,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:27,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:59:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:59:27,279 INFO L87 Difference]: Start difference. First operand 16774 states and 53147 transitions. Second operand 6 states. [2019-12-18 13:59:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:27,362 INFO L93 Difference]: Finished difference Result 3054 states and 7940 transitions. [2019-12-18 13:59:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:59:27,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-18 13:59:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:27,366 INFO L225 Difference]: With dead ends: 3054 [2019-12-18 13:59:27,366 INFO L226 Difference]: Without dead ends: 2685 [2019-12-18 13:59:27,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:59:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2019-12-18 13:59:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2019-12-18 13:59:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-12-18 13:59:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 6902 transitions. [2019-12-18 13:59:27,396 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 6902 transitions. Word has length 23 [2019-12-18 13:59:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:27,396 INFO L462 AbstractCegarLoop]: Abstraction has 2685 states and 6902 transitions. [2019-12-18 13:59:27,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:59:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 6902 transitions. [2019-12-18 13:59:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:59:27,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:27,400 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] [2019-12-18 13:59:27,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 140781568, now seen corresponding path program 1 times [2019-12-18 13:59:27,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:27,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968044119] [2019-12-18 13:59:27,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:27,514 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-18 13:59:27,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968044119] [2019-12-18 13:59:27,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:27,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:59:27,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607582565] [2019-12-18 13:59:27,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:59:27,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:59:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:59:27,517 INFO L87 Difference]: Start difference. First operand 2685 states and 6902 transitions. Second operand 7 states. [2019-12-18 13:59:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:27,646 INFO L93 Difference]: Finished difference Result 1318 states and 3724 transitions. [2019-12-18 13:59:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:59:27,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-18 13:59:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:27,649 INFO L225 Difference]: With dead ends: 1318 [2019-12-18 13:59:27,649 INFO L226 Difference]: Without dead ends: 1269 [2019-12-18 13:59:27,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:59:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-12-18 13:59:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1157. [2019-12-18 13:59:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-12-18 13:59:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 3308 transitions. [2019-12-18 13:59:27,663 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 3308 transitions. Word has length 29 [2019-12-18 13:59:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:27,663 INFO L462 AbstractCegarLoop]: Abstraction has 1157 states and 3308 transitions. [2019-12-18 13:59:27,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:59:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 3308 transitions. [2019-12-18 13:59:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:59:27,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:27,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:27,667 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:27,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2000031092, now seen corresponding path program 1 times [2019-12-18 13:59:27,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:27,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828281598] [2019-12-18 13:59:27,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:27,736 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-18 13:59:27,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828281598] [2019-12-18 13:59:27,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:27,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:59:27,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413537785] [2019-12-18 13:59:27,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:27,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:27,738 INFO L87 Difference]: Start difference. First operand 1157 states and 3308 transitions. Second operand 3 states. [2019-12-18 13:59:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:27,793 INFO L93 Difference]: Finished difference Result 1169 states and 3320 transitions. [2019-12-18 13:59:27,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:59:27,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:59:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:27,796 INFO L225 Difference]: With dead ends: 1169 [2019-12-18 13:59:27,796 INFO L226 Difference]: Without dead ends: 1169 [2019-12-18 13:59:27,797 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-18 13:59:27,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-12-18 13:59:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1164. [2019-12-18 13:59:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2019-12-18 13:59:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 3315 transitions. [2019-12-18 13:59:27,812 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 3315 transitions. Word has length 58 [2019-12-18 13:59:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:27,813 INFO L462 AbstractCegarLoop]: Abstraction has 1164 states and 3315 transitions. [2019-12-18 13:59:27,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:59:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 3315 transitions. [2019-12-18 13:59:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:59:27,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:27,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:27,815 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-18 13:59:27,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:27,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935943356] [2019-12-18 13:59:27,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:27,918 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-18 13:59:27,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935943356] [2019-12-18 13:59:27,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:27,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:59:27,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049744386] [2019-12-18 13:59:27,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:59:27,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:59:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:59:27,920 INFO L87 Difference]: Start difference. First operand 1164 states and 3315 transitions. Second operand 5 states. [2019-12-18 13:59:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:28,176 INFO L93 Difference]: Finished difference Result 1649 states and 4677 transitions. [2019-12-18 13:59:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:59:28,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:59:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:28,179 INFO L225 Difference]: With dead ends: 1649 [2019-12-18 13:59:28,179 INFO L226 Difference]: Without dead ends: 1649 [2019-12-18 13:59:28,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:59:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-12-18 13:59:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1236. [2019-12-18 13:59:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2019-12-18 13:59:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 3527 transitions. [2019-12-18 13:59:28,197 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 3527 transitions. Word has length 58 [2019-12-18 13:59:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:28,197 INFO L462 AbstractCegarLoop]: Abstraction has 1236 states and 3527 transitions. [2019-12-18 13:59:28,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:59:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 3527 transitions. [2019-12-18 13:59:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:59:28,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:28,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:28,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-18 13:59:28,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:28,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758883576] [2019-12-18 13:59:28,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:28,311 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-18 13:59:28,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758883576] [2019-12-18 13:59:28,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:28,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:59:28,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201503461] [2019-12-18 13:59:28,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:59:28,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:59:28,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:59:28,314 INFO L87 Difference]: Start difference. First operand 1236 states and 3527 transitions. Second operand 6 states. [2019-12-18 13:59:28,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:28,655 INFO L93 Difference]: Finished difference Result 1515 states and 4187 transitions. [2019-12-18 13:59:28,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:59:28,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:59:28,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:28,659 INFO L225 Difference]: With dead ends: 1515 [2019-12-18 13:59:28,659 INFO L226 Difference]: Without dead ends: 1515 [2019-12-18 13:59:28,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:59:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-18 13:59:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1292. [2019-12-18 13:59:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1292 states. [2019-12-18 13:59:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3619 transitions. [2019-12-18 13:59:28,677 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3619 transitions. Word has length 58 [2019-12-18 13:59:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:28,678 INFO L462 AbstractCegarLoop]: Abstraction has 1292 states and 3619 transitions. [2019-12-18 13:59:28,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:59:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3619 transitions. [2019-12-18 13:59:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:59:28,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:28,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:28,680 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-18 13:59:28,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:28,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167887121] [2019-12-18 13:59:28,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:28,745 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-18 13:59:28,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167887121] [2019-12-18 13:59:28,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:28,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:59:28,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185205349] [2019-12-18 13:59:28,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:28,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:28,748 INFO L87 Difference]: Start difference. First operand 1292 states and 3619 transitions. Second operand 3 states. [2019-12-18 13:59:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:28,765 INFO L93 Difference]: Finished difference Result 1228 states and 3411 transitions. [2019-12-18 13:59:28,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:59:28,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:59:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:28,768 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:59:28,768 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:59:28,769 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-18 13:59:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:59:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2019-12-18 13:59:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-12-18 13:59:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3411 transitions. [2019-12-18 13:59:28,861 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3411 transitions. Word has length 58 [2019-12-18 13:59:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:28,862 INFO L462 AbstractCegarLoop]: Abstraction has 1228 states and 3411 transitions. [2019-12-18 13:59:28,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:59:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3411 transitions. [2019-12-18 13:59:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:59:28,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:28,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:28,865 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-18 13:59:28,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:28,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888433763] [2019-12-18 13:59:28,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:28,950 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-18 13:59:28,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888433763] [2019-12-18 13:59:28,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:28,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:59:28,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824379053] [2019-12-18 13:59:28,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:59:28,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:28,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:59:28,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:59:28,953 INFO L87 Difference]: Start difference. First operand 1228 states and 3411 transitions. Second operand 3 states. [2019-12-18 13:59:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:29,014 INFO L93 Difference]: Finished difference Result 1227 states and 3409 transitions. [2019-12-18 13:59:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:59:29,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:59:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:29,018 INFO L225 Difference]: With dead ends: 1227 [2019-12-18 13:59:29,018 INFO L226 Difference]: Without dead ends: 1227 [2019-12-18 13:59:29,018 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-18 13:59:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-18 13:59:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 938. [2019-12-18 13:59:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-12-18 13:59:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 2611 transitions. [2019-12-18 13:59:29,040 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 2611 transitions. Word has length 59 [2019-12-18 13:59:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:29,042 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 2611 transitions. [2019-12-18 13:59:29,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:59:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 2611 transitions. [2019-12-18 13:59:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:59:29,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:29,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:29,045 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:29,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1056994783, now seen corresponding path program 1 times [2019-12-18 13:59:29,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:29,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658383902] [2019-12-18 13:59:29,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:29,287 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-18 13:59:29,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658383902] [2019-12-18 13:59:29,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:29,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:59:29,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228013117] [2019-12-18 13:59:29,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:59:29,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:59:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:59:29,290 INFO L87 Difference]: Start difference. First operand 938 states and 2611 transitions. Second operand 10 states. [2019-12-18 13:59:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:29,607 INFO L93 Difference]: Finished difference Result 1783 states and 4612 transitions. [2019-12-18 13:59:29,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:59:29,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-18 13:59:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:29,609 INFO L225 Difference]: With dead ends: 1783 [2019-12-18 13:59:29,610 INFO L226 Difference]: Without dead ends: 1154 [2019-12-18 13:59:29,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:59:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-12-18 13:59:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 798. [2019-12-18 13:59:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-12-18 13:59:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2140 transitions. [2019-12-18 13:59:29,628 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2140 transitions. Word has length 60 [2019-12-18 13:59:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:29,628 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 2140 transitions. [2019-12-18 13:59:29,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:59:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2140 transitions. [2019-12-18 13:59:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:59:29,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:29,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:29,630 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 2 times [2019-12-18 13:59:29,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:29,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813388340] [2019-12-18 13:59:29,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:59:29,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813388340] [2019-12-18 13:59:29,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:29,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:59:29,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86539357] [2019-12-18 13:59:29,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:59:29,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:59:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:59:29,922 INFO L87 Difference]: Start difference. First operand 798 states and 2140 transitions. Second operand 13 states. [2019-12-18 13:59:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:30,689 INFO L93 Difference]: Finished difference Result 2010 states and 4896 transitions. [2019-12-18 13:59:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:59:30,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:59:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:30,691 INFO L225 Difference]: With dead ends: 2010 [2019-12-18 13:59:30,691 INFO L226 Difference]: Without dead ends: 623 [2019-12-18 13:59:30,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:59:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-12-18 13:59:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 451. [2019-12-18 13:59:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-18 13:59:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 975 transitions. [2019-12-18 13:59:30,698 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 975 transitions. Word has length 60 [2019-12-18 13:59:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:30,699 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 975 transitions. [2019-12-18 13:59:30,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:59:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 975 transitions. [2019-12-18 13:59:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:59:30,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:30,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:30,700 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1222711449, now seen corresponding path program 3 times [2019-12-18 13:59:30,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104779082] [2019-12-18 13:59:30,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:30,848 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-18 13:59:30,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104779082] [2019-12-18 13:59:30,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:30,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:59:30,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109561825] [2019-12-18 13:59:30,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:59:30,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:59:30,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:59:30,850 INFO L87 Difference]: Start difference. First operand 451 states and 975 transitions. Second operand 6 states. [2019-12-18 13:59:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:30,934 INFO L93 Difference]: Finished difference Result 689 states and 1422 transitions. [2019-12-18 13:59:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:59:30,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:59:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:30,935 INFO L225 Difference]: With dead ends: 689 [2019-12-18 13:59:30,935 INFO L226 Difference]: Without dead ends: 239 [2019-12-18 13:59:30,935 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-18 13:59:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-12-18 13:59:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2019-12-18 13:59:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 13:59:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-18 13:59:30,943 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-18 13:59:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:30,944 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-18 13:59:30,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:59:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-18 13:59:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:59:30,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:30,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:30,946 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 4 times [2019-12-18 13:59:30,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:30,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070440233] [2019-12-18 13:59:30,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:59:31,231 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-18 13:59:31,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070440233] [2019-12-18 13:59:31,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:59:31,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:59:31,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104087297] [2019-12-18 13:59:31,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:59:31,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:59:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:59:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:59:31,235 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 12 states. [2019-12-18 13:59:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:59:31,609 INFO L93 Difference]: Finished difference Result 366 states and 609 transitions. [2019-12-18 13:59:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:59:31,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:59:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:59:31,610 INFO L225 Difference]: With dead ends: 366 [2019-12-18 13:59:31,610 INFO L226 Difference]: Without dead ends: 333 [2019-12-18 13:59:31,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:59:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-18 13:59:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2019-12-18 13:59:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 13:59:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-18 13:59:31,615 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-18 13:59:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:59:31,616 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-18 13:59:31,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:59:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-18 13:59:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:59:31,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:59:31,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:59:31,617 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:59:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:59:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 5 times [2019-12-18 13:59:31,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:59:31,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295618135] [2019-12-18 13:59:31,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:59:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:59:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:59:31,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:59:31,789 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:59:31,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22| 1)) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1485~0.base_22|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22|)) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22|) |v_ULTIMATE.start_main_~#t1485~0.offset_17| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= 0 |v_ULTIMATE.start_main_~#t1485~0.offset_17|) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1485~0.base_22| 4)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ULTIMATE.start_main_~#t1485~0.base=|v_ULTIMATE.start_main_~#t1485~0.base_22|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_~#t1485~0.offset=|v_ULTIMATE.start_main_~#t1485~0.offset_17|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_20|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_16|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1485~0.base, ULTIMATE.start_main_~#t1488~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1486~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1485~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1487~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t1487~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1486~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1488~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:59:31,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1486~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1486~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13|) |v_ULTIMATE.start_main_~#t1486~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1486~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1486~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1486~0.offset] because there is no mapped edge [2019-12-18 13:59:31,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1487~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1487~0.base_10| 4)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10| 1) |v_#valid_40|) (not (= |v_ULTIMATE.start_main_~#t1487~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1487~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10|) |v_ULTIMATE.start_main_~#t1487~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1487~0.offset, #length, ULTIMATE.start_main_~#t1487~0.base] because there is no mapped edge [2019-12-18 13:59:31,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1488~0.base_11| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1488~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1488~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1488~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11|) |v_ULTIMATE.start_main_~#t1488~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1488~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 13:59:31,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (= ~z$r_buff1_thd3~0_Out1726567649 ~z$r_buff0_thd3~0_In1726567649) (= ~a~0_In1726567649 ~__unbuffered_p3_EAX~0_Out1726567649) (= 1 ~z$r_buff0_thd4~0_Out1726567649) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1726567649)) (= ~z$r_buff1_thd4~0_Out1726567649 ~z$r_buff0_thd4~0_In1726567649) (= ~z$r_buff1_thd0~0_Out1726567649 ~z$r_buff0_thd0~0_In1726567649) (= ~z$r_buff0_thd1~0_In1726567649 ~z$r_buff1_thd1~0_Out1726567649) (= ~z$r_buff0_thd2~0_In1726567649 ~z$r_buff1_thd2~0_Out1726567649)) InVars {~a~0=~a~0_In1726567649, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1726567649, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1726567649, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1726567649, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1726567649, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1726567649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1726567649} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1726567649, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1726567649, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1726567649, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1726567649, ~a~0=~a~0_In1726567649, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1726567649, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1726567649, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1726567649, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1726567649, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1726567649, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1726567649, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1726567649, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1726567649} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 13:59:31,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:59:31,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:59:31,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In513973722 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In513973722 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In513973722 |P3Thread1of1ForFork3_#t~ite11_Out513973722|)) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out513973722| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In513973722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In513973722} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In513973722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In513973722, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out513973722|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:59:31,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1842587464 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1842587464 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-1842587464| ~z$w_buff1~0_In-1842587464)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out-1842587464| ~z~0_In-1842587464) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1842587464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1842587464, ~z$w_buff1~0=~z$w_buff1~0_In-1842587464, ~z~0=~z~0_In-1842587464} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1842587464|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1842587464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1842587464, ~z$w_buff1~0=~z$w_buff1~0_In-1842587464, ~z~0=~z~0_In-1842587464} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:59:31,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:59:31,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In424779508 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In424779508 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In424779508 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In424779508 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out424779508| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In424779508 |P3Thread1of1ForFork3_#t~ite12_Out424779508|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In424779508, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424779508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In424779508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424779508} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In424779508, ~z$w_buff0_used~0=~z$w_buff0_used~0_In424779508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In424779508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424779508, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out424779508|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:59:31,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1634338780 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1634338780 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-1634338780) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1634338780 ~z$r_buff0_thd4~0_Out-1634338780)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634338780, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1634338780} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1634338780, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1634338780, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1634338780|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:59:31,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1466581601 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1466581601 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1466581601 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1466581601 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1466581601| ~z$r_buff1_thd4~0_In1466581601)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1466581601|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1466581601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1466581601, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1466581601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1466581601} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1466581601, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1466581601, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1466581601|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1466581601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1466581601} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:59:31,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:59:31,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1344066671 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1344066671 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1344066671| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1344066671 |P2Thread1of1ForFork2_#t~ite5_Out-1344066671|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1344066671, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1344066671} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1344066671|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1344066671, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1344066671} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:59:31,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In588765213 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In588765213 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In588765213 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In588765213 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out588765213| ~z$w_buff1_used~0_In588765213) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out588765213| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In588765213, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In588765213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In588765213, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588765213} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out588765213|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In588765213, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In588765213, ~z$w_buff1_used~0=~z$w_buff1_used~0_In588765213, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In588765213} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:59:31,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-820392548 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-820392548 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-820392548|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-820392548| ~z$r_buff0_thd3~0_In-820392548)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-820392548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-820392548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-820392548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-820392548, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-820392548|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:59:31,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1221662026 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1221662026 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1221662026 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1221662026 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1221662026 |P2Thread1of1ForFork2_#t~ite8_Out1221662026|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out1221662026| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1221662026, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1221662026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221662026, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1221662026} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1221662026, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1221662026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1221662026, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1221662026, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1221662026|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:59:31,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:59:31,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:59:31,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-803602528 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-803602528 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-803602528| ~z$w_buff1~0_In-803602528)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-803602528| ~z~0_In-803602528)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-803602528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-803602528, ~z$w_buff1~0=~z$w_buff1~0_In-803602528, ~z~0=~z~0_In-803602528} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-803602528|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-803602528, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-803602528, ~z$w_buff1~0=~z$w_buff1~0_In-803602528, ~z~0=~z~0_In-803602528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:59:31,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:59:31,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In744772198 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In744772198 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out744772198| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out744772198| ~z$w_buff0_used~0_In744772198) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744772198, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744772198} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In744772198, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744772198, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out744772198|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:59:31,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1146765646 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1146765646 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1146765646 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1146765646 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1146765646|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1146765646 |ULTIMATE.start_main_#t~ite22_Out1146765646|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1146765646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146765646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1146765646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146765646} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1146765646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1146765646, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1146765646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146765646, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1146765646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:59:31,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-179521949 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-179521949 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-179521949|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-179521949 |ULTIMATE.start_main_#t~ite23_Out-179521949|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-179521949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179521949} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-179521949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179521949, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-179521949|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:59:31,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1166806927 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1166806927 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1166806927 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1166806927 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1166806927 |ULTIMATE.start_main_#t~ite24_Out-1166806927|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-1166806927|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1166806927, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166806927, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1166806927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166806927} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1166806927, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166806927, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1166806927, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1166806927|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166806927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:59:31,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1271746448 256) 0))) (or (and (= ~z$w_buff1~0_In1271746448 |ULTIMATE.start_main_#t~ite33_Out1271746448|) (= |ULTIMATE.start_main_#t~ite33_Out1271746448| |ULTIMATE.start_main_#t~ite34_Out1271746448|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1271746448 256)))) (or (= (mod ~z$w_buff0_used~0_In1271746448 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1271746448 256)) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In1271746448 256) 0) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In1271746448| |ULTIMATE.start_main_#t~ite33_Out1271746448|) (= ~z$w_buff1~0_In1271746448 |ULTIMATE.start_main_#t~ite34_Out1271746448|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1271746448, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1271746448, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1271746448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1271746448, ~z$w_buff1~0=~z$w_buff1~0_In1271746448, ~weak$$choice2~0=~weak$$choice2~0_In1271746448, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1271746448|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1271746448, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1271746448, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1271746448, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1271746448, ~z$w_buff1~0=~z$w_buff1~0_In1271746448, ~weak$$choice2~0=~weak$$choice2~0_In1271746448, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1271746448|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1271746448|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:59:31,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1707636093 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1707636093| |ULTIMATE.start_main_#t~ite39_Out1707636093|) (= ~z$w_buff1_used~0_In1707636093 |ULTIMATE.start_main_#t~ite39_Out1707636093|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1707636093 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1707636093 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1707636093 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1707636093 256)))))) (and (not .cse0) (= ~z$w_buff1_used~0_In1707636093 |ULTIMATE.start_main_#t~ite40_Out1707636093|) (= |ULTIMATE.start_main_#t~ite39_In1707636093| |ULTIMATE.start_main_#t~ite39_Out1707636093|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1707636093, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1707636093, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1707636093|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1707636093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1707636093, ~weak$$choice2~0=~weak$$choice2~0_In1707636093} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1707636093, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1707636093|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1707636093|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1707636093, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1707636093, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1707636093, ~weak$$choice2~0=~weak$$choice2~0_In1707636093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:59:31,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:59:31,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In842946066 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In842946066| |ULTIMATE.start_main_#t~ite45_Out842946066|) (= ~z$r_buff1_thd0~0_In842946066 |ULTIMATE.start_main_#t~ite46_Out842946066|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out842946066| |ULTIMATE.start_main_#t~ite45_Out842946066|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In842946066 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In842946066 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In842946066 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In842946066 256))))) (= ~z$r_buff1_thd0~0_In842946066 |ULTIMATE.start_main_#t~ite45_Out842946066|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In842946066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In842946066, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In842946066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In842946066, ~weak$$choice2~0=~weak$$choice2~0_In842946066, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In842946066|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In842946066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In842946066, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In842946066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In842946066, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out842946066|, ~weak$$choice2~0=~weak$$choice2~0_In842946066, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out842946066|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:59:31,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:59:31,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 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_10, 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-18 13:59:31,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:59:31 BasicIcfg [2019-12-18 13:59:31,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:59:31,940 INFO L168 Benchmark]: Toolchain (without parser) took 32454.72 ms. Allocated memory was 146.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 101.4 MB in the beginning and 800.5 MB in the end (delta: -699.0 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,941 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.31 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 156.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,943 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,944 INFO L168 Benchmark]: RCFGBuilder took 815.42 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 102.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,944 INFO L168 Benchmark]: TraceAbstraction took 30673.46 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.2 MB in the beginning and 800.5 MB in the end (delta: -698.3 MB). Peak memory consumption was 962.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:59:31,948 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.31 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 156.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.42 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 102.2 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30673.46 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.2 MB in the beginning and 800.5 MB in the end (delta: -698.3 MB). Peak memory consumption was 962.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 30.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1753 SDtfs, 2301 SDslu, 4647 SDs, 0 SdLazy, 1848 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52262occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 12684 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 131866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...