/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/mix052_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:54:29,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:54:29,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:54:29,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:54:29,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:54:29,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:54:29,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:54:29,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:54:29,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:54:29,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:54:29,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:54:29,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:54:29,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:54:29,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:54:29,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:54:29,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:54:29,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:54:29,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:54:29,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:54:29,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:54:29,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:54:29,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:54:29,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:54:29,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:54:29,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:54:29,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:54:29,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:54:29,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:54:29,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:54:29,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:54:29,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:54:29,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:54:29,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:54:29,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:54:29,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:54:29,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:54:29,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:54:29,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:54:29,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:54:29,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:54:29,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:54:29,333 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:54:29,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:54:29,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:54:29,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:54:29,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:54:29,366 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:54:29,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:54:29,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:54:29,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:54:29,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:54:29,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:54:29,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:54:29,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:54:29,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:54:29,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:54:29,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:54:29,370 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:54:29,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:54:29,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:54:29,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:54:29,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:54:29,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:54:29,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:54:29,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:54:29,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:54:29,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:54:29,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:54:29,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:54:29,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:54:29,378 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:54:29,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:54:29,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:54:29,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:54:29,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:54:29,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:54:29,704 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:54:29,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.opt.i [2019-12-18 13:54:29,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a01a8908/dbd6123a2c90484887b0a9c16022a651/FLAG9b7fb6c04 [2019-12-18 13:54:30,324 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:54:30,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.opt.i [2019-12-18 13:54:30,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a01a8908/dbd6123a2c90484887b0a9c16022a651/FLAG9b7fb6c04 [2019-12-18 13:54:30,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a01a8908/dbd6123a2c90484887b0a9c16022a651 [2019-12-18 13:54:30,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:54:30,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:54:30,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:54:30,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:54:30,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:54:30,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:54:30" (1/1) ... [2019-12-18 13:54:30,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0f0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:30, skipping insertion in model container [2019-12-18 13:54:30,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:54:30" (1/1) ... [2019-12-18 13:54:30,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:54:30,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:54:31,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:54:31,236 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:54:31,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:54:31,406 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:54:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31 WrapperNode [2019-12-18 13:54:31,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:54:31,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:54:31,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:54:31,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:54:31,417 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:54:31" (1/1) ... [2019-12-18 13:54:31,436 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:54:31" (1/1) ... [2019-12-18 13:54:31,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:54:31,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:54:31,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:54:31,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:54:31,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (1/1) ... [2019-12-18 13:54:31,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:54:31,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:54:31,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:54:31,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:54:31,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (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:54:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:54:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:54:31,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:54:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:54:31,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:54:31,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:54:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:54:31,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:54:31,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:54:31,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:54:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:54:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:54:31,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:54:31,572 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:54:32,269 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:54:32,270 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:54:32,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:54:32 BoogieIcfgContainer [2019-12-18 13:54:32,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:54:32,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:54:32,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:54:32,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:54:32,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:54:30" (1/3) ... [2019-12-18 13:54:32,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4dca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:54:32, skipping insertion in model container [2019-12-18 13:54:32,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:54:31" (2/3) ... [2019-12-18 13:54:32,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f4dca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:54:32, skipping insertion in model container [2019-12-18 13:54:32,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:54:32" (3/3) ... [2019-12-18 13:54:32,280 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.opt.i [2019-12-18 13:54:32,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:54:32,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:54:32,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:54:32,300 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:54:32,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,338 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,338 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,405 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:54:32,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:54:32,442 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:54:32,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:54:32,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:54:32,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:54:32,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:54:32,443 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:54:32,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:54:32,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:54:32,461 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 13:54:32,463 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 13:54:32,538 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 13:54:32,538 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:54:32,560 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 13:54:32,579 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 13:54:32,661 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 13:54:32,661 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:54:32,670 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 13:54:32,686 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 13:54:32,687 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:54:37,598 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:54:37,711 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:54:37,766 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39870 [2019-12-18 13:54:37,767 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 13:54:37,770 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 80 transitions [2019-12-18 13:54:38,569 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 12726 states. [2019-12-18 13:54:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states. [2019-12-18 13:54:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 13:54:38,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:38,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:38,577 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash -534032227, now seen corresponding path program 1 times [2019-12-18 13:54:38,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:38,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940982673] [2019-12-18 13:54:38,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:38,846 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:54:38,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940982673] [2019-12-18 13:54:38,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:38,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:54:38,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279908461] [2019-12-18 13:54:38,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:38,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:38,871 INFO L87 Difference]: Start difference. First operand 12726 states. Second operand 3 states. [2019-12-18 13:54:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:39,370 INFO L93 Difference]: Finished difference Result 12374 states and 47232 transitions. [2019-12-18 13:54:39,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:39,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 13:54:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:39,531 INFO L225 Difference]: With dead ends: 12374 [2019-12-18 13:54:39,532 INFO L226 Difference]: Without dead ends: 11654 [2019-12-18 13:54:39,533 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:54:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11654 states. [2019-12-18 13:54:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11654 to 11654. [2019-12-18 13:54:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-12-18 13:54:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 44412 transitions. [2019-12-18 13:54:40,853 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 44412 transitions. Word has length 7 [2019-12-18 13:54:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:40,855 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 44412 transitions. [2019-12-18 13:54:40,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 44412 transitions. [2019-12-18 13:54:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:54:40,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:40,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:40,869 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 633204052, now seen corresponding path program 1 times [2019-12-18 13:54:40,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711158474] [2019-12-18 13:54:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:54:40,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711158474] [2019-12-18 13:54:40,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:40,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:40,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639083388] [2019-12-18 13:54:40,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:41,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:41,001 INFO L87 Difference]: Start difference. First operand 11654 states and 44412 transitions. Second operand 3 states. [2019-12-18 13:54:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:41,170 INFO L93 Difference]: Finished difference Result 7008 states and 23356 transitions. [2019-12-18 13:54:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:41,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:54:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:41,207 INFO L225 Difference]: With dead ends: 7008 [2019-12-18 13:54:41,208 INFO L226 Difference]: Without dead ends: 7008 [2019-12-18 13:54:41,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2019-12-18 13:54:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7008. [2019-12-18 13:54:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7008 states. [2019-12-18 13:54:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7008 states to 7008 states and 23356 transitions. [2019-12-18 13:54:41,549 INFO L78 Accepts]: Start accepts. Automaton has 7008 states and 23356 transitions. Word has length 13 [2019-12-18 13:54:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:41,550 INFO L462 AbstractCegarLoop]: Abstraction has 7008 states and 23356 transitions. [2019-12-18 13:54:41,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7008 states and 23356 transitions. [2019-12-18 13:54:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 13:54:41,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:41,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:41,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -691058683, now seen corresponding path program 1 times [2019-12-18 13:54:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:41,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046521336] [2019-12-18 13:54:41,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:41,605 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:54:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046521336] [2019-12-18 13:54:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:54:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281947260] [2019-12-18 13:54:41,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:54:41,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:54:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:54:41,607 INFO L87 Difference]: Start difference. First operand 7008 states and 23356 transitions. Second operand 4 states. [2019-12-18 13:54:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:41,666 INFO L93 Difference]: Finished difference Result 1656 states and 4436 transitions. [2019-12-18 13:54:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:54:41,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 13:54:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:41,672 INFO L225 Difference]: With dead ends: 1656 [2019-12-18 13:54:41,672 INFO L226 Difference]: Without dead ends: 1656 [2019-12-18 13:54:41,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:54:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-12-18 13:54:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2019-12-18 13:54:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2019-12-18 13:54:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4436 transitions. [2019-12-18 13:54:41,720 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4436 transitions. Word has length 14 [2019-12-18 13:54:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:41,720 INFO L462 AbstractCegarLoop]: Abstraction has 1656 states and 4436 transitions. [2019-12-18 13:54:41,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:54:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4436 transitions. [2019-12-18 13:54:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:54:41,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:41,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:41,722 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1912379884, now seen corresponding path program 1 times [2019-12-18 13:54:41,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:41,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551758681] [2019-12-18 13:54:41,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:41,799 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:54:41,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551758681] [2019-12-18 13:54:41,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:41,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:41,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433029405] [2019-12-18 13:54:41,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:54:41,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:54:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:54:41,801 INFO L87 Difference]: Start difference. First operand 1656 states and 4436 transitions. Second operand 4 states. [2019-12-18 13:54:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:41,994 INFO L93 Difference]: Finished difference Result 2339 states and 6191 transitions. [2019-12-18 13:54:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:54:41,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:54:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:42,001 INFO L225 Difference]: With dead ends: 2339 [2019-12-18 13:54:42,001 INFO L226 Difference]: Without dead ends: 2339 [2019-12-18 13:54:42,002 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:54:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2019-12-18 13:54:42,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2019-12-18 13:54:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-12-18 13:54:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5853 transitions. [2019-12-18 13:54:42,060 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5853 transitions. Word has length 16 [2019-12-18 13:54:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:42,060 INFO L462 AbstractCegarLoop]: Abstraction has 2187 states and 5853 transitions. [2019-12-18 13:54:42,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:54:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5853 transitions. [2019-12-18 13:54:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:54:42,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:42,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:54:42,062 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1912467552, now seen corresponding path program 1 times [2019-12-18 13:54:42,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:42,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081713198] [2019-12-18 13:54:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:42,163 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:54:42,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081713198] [2019-12-18 13:54:42,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:42,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:42,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909333473] [2019-12-18 13:54:42,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:54:42,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:54:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:54:42,166 INFO L87 Difference]: Start difference. First operand 2187 states and 5853 transitions. Second operand 4 states. [2019-12-18 13:54:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:42,412 INFO L93 Difference]: Finished difference Result 2734 states and 7220 transitions. [2019-12-18 13:54:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:54:42,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:54:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:42,420 INFO L225 Difference]: With dead ends: 2734 [2019-12-18 13:54:42,420 INFO L226 Difference]: Without dead ends: 2734 [2019-12-18 13:54:42,421 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:54:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2019-12-18 13:54:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2088. [2019-12-18 13:54:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-12-18 13:54:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 5552 transitions. [2019-12-18 13:54:42,474 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 5552 transitions. Word has length 16 [2019-12-18 13:54:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:42,474 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 5552 transitions. [2019-12-18 13:54:42,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:54:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 5552 transitions. [2019-12-18 13:54:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:54:42,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:42,479 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:54:42,479 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 941915908, now seen corresponding path program 1 times [2019-12-18 13:54:42,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:42,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541819880] [2019-12-18 13:54:42,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:42,560 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:54:42,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541819880] [2019-12-18 13:54:42,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:42,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598764856] [2019-12-18 13:54:42,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:42,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:42,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:42,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:42,563 INFO L87 Difference]: Start difference. First operand 2088 states and 5552 transitions. Second operand 3 states. [2019-12-18 13:54:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:42,587 INFO L93 Difference]: Finished difference Result 3458 states and 8872 transitions. [2019-12-18 13:54:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:42,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 13:54:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:42,593 INFO L225 Difference]: With dead ends: 3458 [2019-12-18 13:54:42,593 INFO L226 Difference]: Without dead ends: 2190 [2019-12-18 13:54:42,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2019-12-18 13:54:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2160. [2019-12-18 13:54:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2019-12-18 13:54:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5142 transitions. [2019-12-18 13:54:42,640 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 5142 transitions. Word has length 29 [2019-12-18 13:54:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:42,640 INFO L462 AbstractCegarLoop]: Abstraction has 2160 states and 5142 transitions. [2019-12-18 13:54:42,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 5142 transitions. [2019-12-18 13:54:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:54:42,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:42,644 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:54:42,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1752215634, now seen corresponding path program 1 times [2019-12-18 13:54:42,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:42,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840031062] [2019-12-18 13:54:42,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:42,705 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:54:42,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840031062] [2019-12-18 13:54:42,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:42,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:54:42,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679388191] [2019-12-18 13:54:42,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:42,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:42,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:42,708 INFO L87 Difference]: Start difference. First operand 2160 states and 5142 transitions. Second operand 3 states. [2019-12-18 13:54:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:42,764 INFO L93 Difference]: Finished difference Result 3105 states and 7281 transitions. [2019-12-18 13:54:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:42,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 13:54:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:42,773 INFO L225 Difference]: With dead ends: 3105 [2019-12-18 13:54:42,773 INFO L226 Difference]: Without dead ends: 3105 [2019-12-18 13:54:42,774 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:54:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2019-12-18 13:54:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2333. [2019-12-18 13:54:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-12-18 13:54:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 5496 transitions. [2019-12-18 13:54:42,830 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 5496 transitions. Word has length 29 [2019-12-18 13:54:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:42,830 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 5496 transitions. [2019-12-18 13:54:42,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 5496 transitions. [2019-12-18 13:54:42,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:54:42,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:42,835 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:54:42,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1147773388, now seen corresponding path program 1 times [2019-12-18 13:54:42,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:42,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447611471] [2019-12-18 13:54:42,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:42,905 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:54:42,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447611471] [2019-12-18 13:54:42,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:42,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:54:42,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376679938] [2019-12-18 13:54:42,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:54:42,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:42,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:54:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:54:42,909 INFO L87 Difference]: Start difference. First operand 2333 states and 5496 transitions. Second operand 5 states. [2019-12-18 13:54:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:42,957 INFO L93 Difference]: Finished difference Result 1416 states and 3199 transitions. [2019-12-18 13:54:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:54:42,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 13:54:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:42,960 INFO L225 Difference]: With dead ends: 1416 [2019-12-18 13:54:42,960 INFO L226 Difference]: Without dead ends: 724 [2019-12-18 13:54:42,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:54:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-18 13:54:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 684. [2019-12-18 13:54:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-12-18 13:54:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1507 transitions. [2019-12-18 13:54:42,984 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1507 transitions. Word has length 29 [2019-12-18 13:54:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:42,985 INFO L462 AbstractCegarLoop]: Abstraction has 684 states and 1507 transitions. [2019-12-18 13:54:42,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:54:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1507 transitions. [2019-12-18 13:54:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:54:42,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:42,991 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] [2019-12-18 13:54:42,992 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 733117723, now seen corresponding path program 1 times [2019-12-18 13:54:42,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:42,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266782042] [2019-12-18 13:54:42,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:43,121 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:54:43,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266782042] [2019-12-18 13:54:43,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:43,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:54:43,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607583393] [2019-12-18 13:54:43,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:54:43,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:54:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:54:43,124 INFO L87 Difference]: Start difference. First operand 684 states and 1507 transitions. Second operand 7 states. [2019-12-18 13:54:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:43,402 INFO L93 Difference]: Finished difference Result 1802 states and 3913 transitions. [2019-12-18 13:54:43,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:54:43,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 13:54:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:43,407 INFO L225 Difference]: With dead ends: 1802 [2019-12-18 13:54:43,407 INFO L226 Difference]: Without dead ends: 1196 [2019-12-18 13:54:43,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:54:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-12-18 13:54:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 786. [2019-12-18 13:54:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-12-18 13:54:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1727 transitions. [2019-12-18 13:54:43,425 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1727 transitions. Word has length 44 [2019-12-18 13:54:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:43,425 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 1727 transitions. [2019-12-18 13:54:43,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:54:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1727 transitions. [2019-12-18 13:54:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:54:43,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:43,428 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] [2019-12-18 13:54:43,428 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:43,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:43,428 INFO L82 PathProgramCache]: Analyzing trace with hash 191693083, now seen corresponding path program 2 times [2019-12-18 13:54:43,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:43,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923214786] [2019-12-18 13:54:43,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:43,590 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:54:43,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923214786] [2019-12-18 13:54:43,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:43,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:54:43,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622724720] [2019-12-18 13:54:43,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:54:43,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:54:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:54:43,592 INFO L87 Difference]: Start difference. First operand 786 states and 1727 transitions. Second operand 7 states. [2019-12-18 13:54:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:44,208 INFO L93 Difference]: Finished difference Result 949 states and 1969 transitions. [2019-12-18 13:54:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:54:44,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 13:54:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:44,212 INFO L225 Difference]: With dead ends: 949 [2019-12-18 13:54:44,212 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 13:54:44,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:54:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 13:54:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 802. [2019-12-18 13:54:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-18 13:54:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1708 transitions. [2019-12-18 13:54:44,228 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1708 transitions. Word has length 44 [2019-12-18 13:54:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:44,228 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1708 transitions. [2019-12-18 13:54:44,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:54:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1708 transitions. [2019-12-18 13:54:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:54:44,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:44,231 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] [2019-12-18 13:54:44,231 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:44,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2122403240, now seen corresponding path program 1 times [2019-12-18 13:54:44,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:44,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37930183] [2019-12-18 13:54:44,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:44,273 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:54:44,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37930183] [2019-12-18 13:54:44,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:44,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:54:44,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371313356] [2019-12-18 13:54:44,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:44,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:44,275 INFO L87 Difference]: Start difference. First operand 802 states and 1708 transitions. Second operand 3 states. [2019-12-18 13:54:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:44,311 INFO L93 Difference]: Finished difference Result 980 states and 1953 transitions. [2019-12-18 13:54:44,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:44,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 13:54:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:44,313 INFO L225 Difference]: With dead ends: 980 [2019-12-18 13:54:44,313 INFO L226 Difference]: Without dead ends: 980 [2019-12-18 13:54:44,314 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:54:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-12-18 13:54:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 840. [2019-12-18 13:54:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 13:54:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1687 transitions. [2019-12-18 13:54:44,328 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1687 transitions. Word has length 44 [2019-12-18 13:54:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:44,329 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1687 transitions. [2019-12-18 13:54:44,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1687 transitions. [2019-12-18 13:54:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 13:54:44,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:44,332 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] [2019-12-18 13:54:44,332 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1018908397, now seen corresponding path program 3 times [2019-12-18 13:54:44,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:44,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312601992] [2019-12-18 13:54:44,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:54:44,421 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:54:44,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312601992] [2019-12-18 13:54:44,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:54:44,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:54:44,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163501432] [2019-12-18 13:54:44,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:54:44,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:54:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:54:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:54:44,424 INFO L87 Difference]: Start difference. First operand 840 states and 1687 transitions. Second operand 3 states. [2019-12-18 13:54:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:54:44,438 INFO L93 Difference]: Finished difference Result 838 states and 1682 transitions. [2019-12-18 13:54:44,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:54:44,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 13:54:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:54:44,442 INFO L225 Difference]: With dead ends: 838 [2019-12-18 13:54:44,442 INFO L226 Difference]: Without dead ends: 838 [2019-12-18 13:54:44,443 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:54:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-18 13:54:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 725. [2019-12-18 13:54:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-12-18 13:54:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1478 transitions. [2019-12-18 13:54:44,457 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1478 transitions. Word has length 44 [2019-12-18 13:54:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:54:44,457 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 1478 transitions. [2019-12-18 13:54:44,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:54:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1478 transitions. [2019-12-18 13:54:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 13:54:44,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:54:44,459 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] [2019-12-18 13:54:44,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:54:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:54:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1361037591, now seen corresponding path program 1 times [2019-12-18 13:54:44,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:54:44,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403622587] [2019-12-18 13:54:44,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:54:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:54:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:54:44,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:54:44,626 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:54:44,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$w_buff1_used~0_392 0) (= v_~x~0_45 0) (= 0 |v_ULTIMATE.start_main_~#t1406~0.offset_23|) (= v_~y$mem_tmp~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1406~0.base_31| 4)) (= 0 v_~y$r_buff1_thd1~0_88) (= v_~weak$$choice2~0_148 0) (= v_~y$r_buff0_thd1~0_34 0) (= v_~y$w_buff0_used~0_595 0) (= v_~y$r_buff1_thd0~0_147 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31|)) (= 0 v_~y$flush_delayed~0_39) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1406~0.base_31|) |v_ULTIMATE.start_main_~#t1406~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_173) (= v_~y$r_buff0_thd0~0_94 0) (= 0 v_~__unbuffered_p2_EAX~0_109) (= 0 v_~y$r_buff0_thd2~0_289) (= v_~y$w_buff1~0_216 0) (= v_~z~0_45 0) (= 0 v_~y$w_buff0~0_304) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= v_~y~0_127 0) (= v_~main$tmp_guard0~0_20 0) (= v_~y$read_delayed~0_5 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1406~0.base_31| 1) |v_#valid_62|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1406~0.base_31|) (= 0 v_~y$r_buff1_thd2~0_268) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd3~0_150) (= 0 v_~__unbuffered_cnt~0_97) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1406~0.base=|v_ULTIMATE.start_main_~#t1406~0.base_31|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, #NULL.offset=|v_#NULL.offset_4|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_150, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_34, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_15|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_65|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_289, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1406~0.offset=|v_ULTIMATE.start_main_~#t1406~0.offset_23|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, ~x~0=v_~x~0_45, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_595, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_88, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_304, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~y~0=v_~y~0_127, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_268, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_94, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1406~0.base, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ULTIMATE.start_main_~#t1407~0.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1408~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1408~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t1406~0.offset, ULTIMATE.start_main_~#t1407~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:54:44,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L810-1-->L812: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1407~0.base_9| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1407~0.base_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t1407~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1407~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1407~0.base_9|) |v_ULTIMATE.start_main_~#t1407~0.offset_9| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1407~0.offset=|v_ULTIMATE.start_main_~#t1407~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1407~0.base=|v_ULTIMATE.start_main_~#t1407~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1407~0.offset, #length, ULTIMATE.start_main_~#t1407~0.base] because there is no mapped edge [2019-12-18 13:54:44,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L812-1-->L814: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1408~0.base_10| 4)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1408~0.base_10|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1408~0.base_10|) 0) (= 0 |v_ULTIMATE.start_main_~#t1408~0.offset_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1408~0.base_10|) |v_ULTIMATE.start_main_~#t1408~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1408~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ULTIMATE.start_main_~#t1408~0.base=|v_ULTIMATE.start_main_~#t1408~0.base_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1408~0.offset=|v_ULTIMATE.start_main_~#t1408~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1408~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1408~0.offset, #length] because there is no mapped edge [2019-12-18 13:54:44,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_26) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (= v_~y$r_buff0_thd3~0_25 1) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_20)) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_26 v_~y$r_buff1_thd3~0_26)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_20, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:54:44,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_32 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= v_~x~0_16 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~z~0=v_~z~0_32, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_16, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:54:44,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L752-->L752-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1318996025 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1318996025 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In1318996025 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1318996025 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1318996025 256) 0))) .cse1 (= ~y$w_buff0~0_In1318996025 |P1Thread1of1ForFork1_#t~ite8_Out1318996025|) (= |P1Thread1of1ForFork1_#t~ite8_Out1318996025| |P1Thread1of1ForFork1_#t~ite9_Out1318996025|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In1318996025| |P1Thread1of1ForFork1_#t~ite8_Out1318996025|) (= ~y$w_buff0~0_In1318996025 |P1Thread1of1ForFork1_#t~ite9_Out1318996025|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1318996025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318996025, ~y$w_buff0~0=~y$w_buff0~0_In1318996025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1318996025, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1318996025|, ~weak$$choice2~0=~weak$$choice2~0_In1318996025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318996025} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1318996025, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318996025, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1318996025|, ~y$w_buff0~0=~y$w_buff0~0_In1318996025, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1318996025, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1318996025|, ~weak$$choice2~0=~weak$$choice2~0_In1318996025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1318996025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:54:44,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L753-->L753-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In286018096 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out286018096| ~y$w_buff1~0_In286018096) (= |P1Thread1of1ForFork1_#t~ite12_Out286018096| |P1Thread1of1ForFork1_#t~ite11_Out286018096|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In286018096 256) 0))) (or (= (mod ~y$w_buff0_used~0_In286018096 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In286018096 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In286018096 256))))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out286018096| ~y$w_buff1~0_In286018096) (= |P1Thread1of1ForFork1_#t~ite11_In286018096| |P1Thread1of1ForFork1_#t~ite11_Out286018096|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In286018096, ~y$w_buff1~0=~y$w_buff1~0_In286018096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In286018096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In286018096, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In286018096|, ~weak$$choice2~0=~weak$$choice2~0_In286018096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286018096} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In286018096, ~y$w_buff1~0=~y$w_buff1~0_In286018096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In286018096, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In286018096, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out286018096|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out286018096|, ~weak$$choice2~0=~weak$$choice2~0_In286018096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In286018096} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:54:44,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_124 v_~y$r_buff0_thd2~0_123) (not (= (mod v_~weak$$choice2~0_36 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_36} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_123, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:54:44,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~__unbuffered_cnt~0_24 (+ v_~__unbuffered_cnt~0_25 1)) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_33 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~y~0=v_~y~0_33, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 13:54:44,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In649955879 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In649955879 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out649955879|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In649955879 |P2Thread1of1ForFork2_#t~ite28_Out649955879|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In649955879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In649955879} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In649955879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In649955879, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out649955879|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 13:54:44,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1626913579 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1626913579 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1626913579 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1626913579 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1626913579 |P2Thread1of1ForFork2_#t~ite29_Out1626913579|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1626913579|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1626913579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1626913579, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1626913579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626913579} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1626913579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1626913579, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1626913579, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1626913579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1626913579} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:54:44,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In90121099 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In90121099 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out90121099 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out90121099 ~y$r_buff0_thd3~0_In90121099)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In90121099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In90121099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In90121099, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out90121099|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out90121099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:54:44,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1533661888 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1533661888 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1533661888 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1533661888 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite31_Out1533661888| ~y$r_buff1_thd3~0_In1533661888) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite31_Out1533661888| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1533661888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533661888, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1533661888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533661888} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1533661888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533661888, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1533661888|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1533661888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533661888} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:54:44,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_28| v_~y$r_buff1_thd3~0_57) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:54:44,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (= 3 v_~__unbuffered_cnt~0_23) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:54:44,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In787342805 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In787342805 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out787342805| ~y~0_In787342805) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out787342805| ~y$w_buff1~0_In787342805) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In787342805, ~y~0=~y~0_In787342805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787342805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787342805} OutVars{~y$w_buff1~0=~y$w_buff1~0_In787342805, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out787342805|, ~y~0=~y~0_In787342805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In787342805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In787342805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 13:54:44,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_26 |v_ULTIMATE.start_main_#t~ite35_14|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 13:54:44,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1559886953 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1559886953 256)))) (or (and (= ~y$w_buff0_used~0_In1559886953 |ULTIMATE.start_main_#t~ite37_Out1559886953|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out1559886953|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1559886953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559886953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1559886953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1559886953, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1559886953|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:54:44,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1630160938 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1630160938 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1630160938 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1630160938 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1630160938|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1630160938 |ULTIMATE.start_main_#t~ite38_Out1630160938|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1630160938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1630160938, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1630160938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1630160938} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1630160938, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1630160938, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1630160938|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1630160938, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1630160938} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:54:44,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-747515743 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-747515743 256)))) (or (and (= ~y$r_buff0_thd0~0_In-747515743 |ULTIMATE.start_main_#t~ite39_Out-747515743|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-747515743|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-747515743, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-747515743} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-747515743, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-747515743|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-747515743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:54:44,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In501690622 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In501690622 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In501690622 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In501690622 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out501690622|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out501690622| ~y$r_buff1_thd0~0_In501690622) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In501690622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In501690622, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In501690622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In501690622} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out501690622|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In501690622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In501690622, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In501690622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In501690622} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:54:44,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_136 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= 0 v_~__unbuffered_p1_EAX~0_43) (= v_~x~0_34 2) (= 0 v_~__unbuffered_p2_EAX~0_98)) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:54:44,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:54:44 BasicIcfg [2019-12-18 13:54:44,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:54:44,742 INFO L168 Benchmark]: Toolchain (without parser) took 14106.09 ms. Allocated memory was 138.9 MB in the beginning and 573.6 MB in the end (delta: 434.6 MB). Free memory was 102.2 MB in the beginning and 285.5 MB in the end (delta: -183.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,743 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.00 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,745 INFO L168 Benchmark]: Boogie Preprocessor took 36.59 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,746 INFO L168 Benchmark]: RCFGBuilder took 763.11 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 107.8 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,747 INFO L168 Benchmark]: TraceAbstraction took 12467.25 ms. Allocated memory was 201.3 MB in the beginning and 573.6 MB in the end (delta: 372.2 MB). Free memory was 107.1 MB in the beginning and 285.5 MB in the end (delta: -178.4 MB). Peak memory consumption was 193.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:54:44,751 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.00 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.95 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.59 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.11 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 107.8 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12467.25 ms. Allocated memory was 201.3 MB in the beginning and 573.6 MB in the end (delta: 372.2 MB). Free memory was 107.1 MB in the beginning and 285.5 MB in the end (delta: -178.4 MB). Peak memory consumption was 193.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 151 ProgramPointsBefore, 72 ProgramPointsAfterwards, 176 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 21 ChoiceCompositions, 5098 VarBasedMoverChecksPositive, 188 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 154 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39870 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1406, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1407, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1408, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1342 SDtfs, 1122 SDslu, 2304 SDs, 0 SdLazy, 1020 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12726occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2432 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 31185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...