/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:10:12,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:10:12,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:10:12,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:10:12,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:10:12,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:10:12,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:10:12,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:10:12,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:10:12,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:10:12,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:10:12,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:10:12,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:10:12,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:10:12,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:10:12,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:10:12,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:10:12,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:10:12,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:10:12,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:10:12,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:10:12,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:10:12,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:10:12,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:10:12,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:10:12,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:10:12,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:10:12,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:10:12,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:10:12,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:10:12,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:10:12,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:10:12,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:10:12,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:10:12,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:10:12,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:10:12,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:10:12,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:10:12,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:10:12,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:10:12,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:10:12,392 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:10:12,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:10:12,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:10:12,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:10:12,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:10:12,414 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:10:12,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:10:12,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:10:12,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:10:12,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:10:12,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:10:12,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:10:12,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:10:12,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:10:12,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:10:12,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:10:12,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:10:12,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:10:12,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:10:12,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:10:12,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:10:12,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:10:12,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:10:12,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:10:12,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:10:12,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:10:12,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:10:12,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:10:12,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:10:12,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:10:12,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:10:12,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:10:12,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:10:12,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:10:12,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:10:12,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-18 17:10:12,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6d38035/4957ef2c84d54251923a2757233b5a43/FLAG0d0a82642 [2019-12-18 17:10:13,430 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:10:13,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-18 17:10:13,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6d38035/4957ef2c84d54251923a2757233b5a43/FLAG0d0a82642 [2019-12-18 17:10:13,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6d38035/4957ef2c84d54251923a2757233b5a43 [2019-12-18 17:10:13,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:10:13,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:10:13,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:10:13,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:10:13,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:10:13,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:10:13" (1/1) ... [2019-12-18 17:10:13,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:13, skipping insertion in model container [2019-12-18 17:10:13,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:10:13" (1/1) ... [2019-12-18 17:10:13,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:10:13,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:10:14,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:10:14,250 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:10:14,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:10:14,399 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:10:14,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14 WrapperNode [2019-12-18 17:10:14,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:10:14,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:10:14,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:10:14,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:10:14,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:10:14,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:10:14,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:10:14,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:10:14,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (1/1) ... [2019-12-18 17:10:14,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:10:14,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:10:14,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:10:14,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:10:14,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (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 17:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:10:14,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:10:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:10:14,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:10:14,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:10:14,558 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:10:14,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:10:14,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:10:14,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:10:14,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:10:14,564 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 17:10:15,303 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:10:15,303 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:10:15,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:10:15 BoogieIcfgContainer [2019-12-18 17:10:15,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:10:15,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:10:15,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:10:15,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:10:15,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:10:13" (1/3) ... [2019-12-18 17:10:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:10:15, skipping insertion in model container [2019-12-18 17:10:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:10:14" (2/3) ... [2019-12-18 17:10:15,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee9bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:10:15, skipping insertion in model container [2019-12-18 17:10:15,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:10:15" (3/3) ... [2019-12-18 17:10:15,313 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-18 17:10:15,323 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:10:15,324 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:10:15,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:10:15,333 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:10:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,419 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:10:15,436 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 17:10:15,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:10:15,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:10:15,457 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:10:15,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:10:15,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:10:15,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:10:15,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:10:15,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:10:15,474 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-18 17:10:15,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-18 17:10:15,569 INFO L126 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-18 17:10:15,569 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:10:15,587 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 17:10:15,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-18 17:10:15,665 INFO L126 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-18 17:10:15,666 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:10:15,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 17:10:15,688 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 17:10:15,689 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:10:20,155 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-18 17:10:20,496 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-18 17:10:20,622 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-18 17:10:20,815 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:10:20,954 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 17:10:20,993 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-18 17:10:20,994 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 17:10:20,998 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-18 17:10:21,325 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-18 17:10:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-18 17:10:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 17:10:21,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:21,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 17:10:21,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-18 17:10:21,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263612235] [2019-12-18 17:10:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:21,606 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 17:10:21,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263612235] [2019-12-18 17:10:21,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:21,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:10:21,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426132822] [2019-12-18 17:10:21,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:21,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:21,626 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-18 17:10:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:21,848 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-18 17:10:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:21,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 17:10:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:21,937 INFO L225 Difference]: With dead ends: 6414 [2019-12-18 17:10:21,937 INFO L226 Difference]: Without dead ends: 6042 [2019-12-18 17:10:21,939 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 17:10:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-18 17:10:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-18 17:10:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-18 17:10:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-18 17:10:22,391 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-18 17:10:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:22,392 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-18 17:10:22,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-18 17:10:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:10:22,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:22,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:22,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-18 17:10:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:22,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958556479] [2019-12-18 17:10:22,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:22,504 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 17:10:22,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958556479] [2019-12-18 17:10:22,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:22,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:22,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967475823] [2019-12-18 17:10:22,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:22,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:22,508 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 3 states. [2019-12-18 17:10:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:22,530 INFO L93 Difference]: Finished difference Result 1215 states and 3009 transitions. [2019-12-18 17:10:22,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:22,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 17:10:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:22,538 INFO L225 Difference]: With dead ends: 1215 [2019-12-18 17:10:22,539 INFO L226 Difference]: Without dead ends: 1215 [2019-12-18 17:10:22,540 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 17:10:22,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-18 17:10:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-18 17:10:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-18 17:10:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3009 transitions. [2019-12-18 17:10:22,574 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3009 transitions. Word has length 11 [2019-12-18 17:10:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:22,574 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3009 transitions. [2019-12-18 17:10:22,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3009 transitions. [2019-12-18 17:10:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:22,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:22,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:22,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:22,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-18 17:10:22,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:22,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710170054] [2019-12-18 17:10:22,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:22,639 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 17:10:22,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710170054] [2019-12-18 17:10:22,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:22,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:22,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764641025] [2019-12-18 17:10:22,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:22,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:22,642 INFO L87 Difference]: Start difference. First operand 1215 states and 3009 transitions. Second operand 3 states. [2019-12-18 17:10:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:22,736 INFO L93 Difference]: Finished difference Result 1870 states and 4688 transitions. [2019-12-18 17:10:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:22,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 17:10:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:22,748 INFO L225 Difference]: With dead ends: 1870 [2019-12-18 17:10:22,749 INFO L226 Difference]: Without dead ends: 1870 [2019-12-18 17:10:22,750 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 17:10:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-18 17:10:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1354. [2019-12-18 17:10:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-12-18 17:10:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3400 transitions. [2019-12-18 17:10:22,805 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3400 transitions. Word has length 14 [2019-12-18 17:10:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 3400 transitions. [2019-12-18 17:10:22,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3400 transitions. [2019-12-18 17:10:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:22,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:22,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:22,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-18 17:10:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170848704] [2019-12-18 17:10:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:22,954 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 17:10:22,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170848704] [2019-12-18 17:10:22,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:22,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:22,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971307441] [2019-12-18 17:10:22,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:22,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:22,959 INFO L87 Difference]: Start difference. First operand 1354 states and 3400 transitions. Second operand 4 states. [2019-12-18 17:10:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:23,129 INFO L93 Difference]: Finished difference Result 1775 states and 4313 transitions. [2019-12-18 17:10:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:10:23,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:10:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:23,140 INFO L225 Difference]: With dead ends: 1775 [2019-12-18 17:10:23,140 INFO L226 Difference]: Without dead ends: 1775 [2019-12-18 17:10:23,141 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 17:10:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-18 17:10:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1643. [2019-12-18 17:10:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-12-18 17:10:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4018 transitions. [2019-12-18 17:10:23,189 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4018 transitions. Word has length 14 [2019-12-18 17:10:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:23,190 INFO L462 AbstractCegarLoop]: Abstraction has 1643 states and 4018 transitions. [2019-12-18 17:10:23,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4018 transitions. [2019-12-18 17:10:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:10:23,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:23,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:23,191 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:23,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-18 17:10:23,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:23,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379775577] [2019-12-18 17:10:23,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:10:23,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379775577] [2019-12-18 17:10:23,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:23,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:23,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693804790] [2019-12-18 17:10:23,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:23,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:23,285 INFO L87 Difference]: Start difference. First operand 1643 states and 4018 transitions. Second operand 4 states. [2019-12-18 17:10:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:23,445 INFO L93 Difference]: Finished difference Result 2036 states and 4889 transitions. [2019-12-18 17:10:23,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:10:23,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:10:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:23,457 INFO L225 Difference]: With dead ends: 2036 [2019-12-18 17:10:23,457 INFO L226 Difference]: Without dead ends: 2036 [2019-12-18 17:10:23,457 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 17:10:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-18 17:10:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1664. [2019-12-18 17:10:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-18 17:10:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-18 17:10:23,503 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 14 [2019-12-18 17:10:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:23,504 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-18 17:10:23,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-18 17:10:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:10:23,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:23,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:10:23,507 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-18 17:10:23,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:23,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564654514] [2019-12-18 17:10:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:10:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564654514] [2019-12-18 17:10:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:23,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:23,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91037346] [2019-12-18 17:10:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:23,574 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 4 states. [2019-12-18 17:10:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:23,594 INFO L93 Difference]: Finished difference Result 723 states and 1652 transitions. [2019-12-18 17:10:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:10:23,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 17:10:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:23,599 INFO L225 Difference]: With dead ends: 723 [2019-12-18 17:10:23,599 INFO L226 Difference]: Without dead ends: 723 [2019-12-18 17:10:23,600 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 17:10:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-18 17:10:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 703. [2019-12-18 17:10:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-18 17:10:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1612 transitions. [2019-12-18 17:10:23,615 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1612 transitions. Word has length 26 [2019-12-18 17:10:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:23,616 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1612 transitions. [2019-12-18 17:10:23,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1612 transitions. [2019-12-18 17:10:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:10:23,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:23,618 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] [2019-12-18 17:10:23,618 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-18 17:10:23,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:23,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445966446] [2019-12-18 17:10:23,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:23,691 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 17:10:23,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445966446] [2019-12-18 17:10:23,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:23,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:10:23,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276298085] [2019-12-18 17:10:23,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:10:23,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:23,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:10:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:10:23,693 INFO L87 Difference]: Start difference. First operand 703 states and 1612 transitions. Second operand 4 states. [2019-12-18 17:10:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:23,717 INFO L93 Difference]: Finished difference Result 1112 states and 2596 transitions. [2019-12-18 17:10:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:10:23,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 17:10:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:23,720 INFO L225 Difference]: With dead ends: 1112 [2019-12-18 17:10:23,721 INFO L226 Difference]: Without dead ends: 428 [2019-12-18 17:10:23,721 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 17:10:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-18 17:10:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-12-18 17:10:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-18 17:10:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1015 transitions. [2019-12-18 17:10:23,730 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1015 transitions. Word has length 41 [2019-12-18 17:10:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:23,731 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 1015 transitions. [2019-12-18 17:10:23,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:10:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1015 transitions. [2019-12-18 17:10:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:10:23,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:23,733 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] [2019-12-18 17:10:23,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1541326249, now seen corresponding path program 2 times [2019-12-18 17:10:23,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:23,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004819641] [2019-12-18 17:10:23,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:23,886 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 17:10:23,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004819641] [2019-12-18 17:10:23,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:23,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:10:23,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124766892] [2019-12-18 17:10:23,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:10:23,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:10:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:10:23,889 INFO L87 Difference]: Start difference. First operand 428 states and 1015 transitions. Second operand 7 states. [2019-12-18 17:10:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:24,083 INFO L93 Difference]: Finished difference Result 824 states and 1900 transitions. [2019-12-18 17:10:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:10:24,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 17:10:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:24,086 INFO L225 Difference]: With dead ends: 824 [2019-12-18 17:10:24,087 INFO L226 Difference]: Without dead ends: 536 [2019-12-18 17:10:24,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:10:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-18 17:10:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 476. [2019-12-18 17:10:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-18 17:10:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1097 transitions. [2019-12-18 17:10:24,098 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1097 transitions. Word has length 41 [2019-12-18 17:10:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:24,099 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1097 transitions. [2019-12-18 17:10:24,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:10:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1097 transitions. [2019-12-18 17:10:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:10:24,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:24,102 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] [2019-12-18 17:10:24,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1953316183, now seen corresponding path program 3 times [2019-12-18 17:10:24,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:24,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809374999] [2019-12-18 17:10:24,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:24,241 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 17:10:24,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809374999] [2019-12-18 17:10:24,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:24,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:10:24,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023247720] [2019-12-18 17:10:24,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:10:24,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:10:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:10:24,243 INFO L87 Difference]: Start difference. First operand 476 states and 1097 transitions. Second operand 6 states. [2019-12-18 17:10:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:24,638 INFO L93 Difference]: Finished difference Result 808 states and 1797 transitions. [2019-12-18 17:10:24,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:10:24,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 17:10:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:24,644 INFO L225 Difference]: With dead ends: 808 [2019-12-18 17:10:24,644 INFO L226 Difference]: Without dead ends: 796 [2019-12-18 17:10:24,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:10:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-18 17:10:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 753. [2019-12-18 17:10:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-18 17:10:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1693 transitions. [2019-12-18 17:10:24,661 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1693 transitions. Word has length 41 [2019-12-18 17:10:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:24,661 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1693 transitions. [2019-12-18 17:10:24,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:10:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1693 transitions. [2019-12-18 17:10:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 17:10:24,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:24,663 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] [2019-12-18 17:10:24,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1269710711, now seen corresponding path program 4 times [2019-12-18 17:10:24,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:24,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179045179] [2019-12-18 17:10:24,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:10:24,813 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 17:10:24,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179045179] [2019-12-18 17:10:24,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:10:24,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:10:24,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221885111] [2019-12-18 17:10:24,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:10:24,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:10:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:10:24,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:10:24,815 INFO L87 Difference]: Start difference. First operand 753 states and 1693 transitions. Second operand 3 states. [2019-12-18 17:10:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:10:24,830 INFO L93 Difference]: Finished difference Result 751 states and 1688 transitions. [2019-12-18 17:10:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:10:24,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 17:10:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:10:24,839 INFO L225 Difference]: With dead ends: 751 [2019-12-18 17:10:24,839 INFO L226 Difference]: Without dead ends: 751 [2019-12-18 17:10:24,840 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 17:10:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-18 17:10:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 695. [2019-12-18 17:10:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-18 17:10:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-18 17:10:24,856 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 41 [2019-12-18 17:10:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:10:24,859 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-18 17:10:24,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:10:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-18 17:10:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:10:24,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:10:24,862 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] [2019-12-18 17:10:24,862 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:10:24,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:10:24,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 1 times [2019-12-18 17:10:24,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:10:24,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800191800] [2019-12-18 17:10:24,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:10:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:10:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:10:25,027 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:10:25,028 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:10:25,032 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~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, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:10:25,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-12-18 17:10:25,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd1~0_In-550672966 ~y$r_buff1_thd1~0_Out-550672966) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-550672966 0)) (= ~z~0_Out-550672966 ~__unbuffered_p1_EAX~0_Out-550672966) (= ~y$r_buff1_thd2~0_Out-550672966 ~y$r_buff0_thd2~0_In-550672966) (= ~z~0_Out-550672966 1) (= ~y$r_buff0_thd2~0_Out-550672966 1) (= ~y$r_buff1_thd0~0_Out-550672966 ~y$r_buff0_thd0~0_In-550672966) (= ~a~0_In-550672966 ~__unbuffered_p1_EBX~0_Out-550672966)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-550672966, ~a~0=~a~0_In-550672966, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-550672966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-550672966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-550672966} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-550672966, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-550672966, ~a~0=~a~0_In-550672966, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-550672966, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-550672966, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-550672966, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-550672966, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-550672966, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-550672966, ~z~0=~z~0_Out-550672966, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-550672966} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:10:25,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1138497539 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1138497539 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1138497539|)) (and (= ~y$w_buff0_used~0_In-1138497539 |P1Thread1of1ForFork1_#t~ite28_Out-1138497539|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138497539, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138497539} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138497539, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138497539, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1138497539|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 17:10:25,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-61148924 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-61148924 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-61148924 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-61148924 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-61148924 |P1Thread1of1ForFork1_#t~ite29_Out-61148924|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-61148924|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-61148924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-61148924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-61148924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-61148924} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-61148924, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-61148924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-61148924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-61148924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-61148924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-18 17:10:25,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_11|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-18 17:10:25,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2029629099 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In2029629099| |P0Thread1of1ForFork0_#t~ite23_Out2029629099|) (= |P0Thread1of1ForFork0_#t~ite24_Out2029629099| ~y$r_buff1_thd1~0_In2029629099)) (and (= |P0Thread1of1ForFork0_#t~ite24_Out2029629099| |P0Thread1of1ForFork0_#t~ite23_Out2029629099|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In2029629099 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2029629099 256))) (= 0 (mod ~y$w_buff0_used~0_In2029629099 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2029629099 256)) .cse1))) .cse0 (= ~y$r_buff1_thd1~0_In2029629099 |P0Thread1of1ForFork0_#t~ite23_Out2029629099|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2029629099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2029629099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2029629099, ~weak$$choice2~0=~weak$$choice2~0_In2029629099, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2029629099, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In2029629099|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2029629099, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2029629099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2029629099, ~weak$$choice2~0=~weak$$choice2~0_In2029629099, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out2029629099|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out2029629099|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2029629099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-18 17:10:25,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 17:10:25,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-505766850 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-505766850 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-505766850 ~y$r_buff0_thd2~0_Out-505766850) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd2~0_Out-505766850 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-505766850, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-505766850} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-505766850|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-505766850, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-505766850} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 17:10:25,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1325786975 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1325786975 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1325786975 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1325786975 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1325786975 |P1Thread1of1ForFork1_#t~ite31_Out-1325786975|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite31_Out-1325786975| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1325786975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325786975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1325786975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1325786975} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1325786975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1325786975, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1325786975|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1325786975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1325786975} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:10:25,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#t~ite31_30| v_~y$r_buff1_thd2~0_59)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:10:25,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:10:25,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1619184485 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1619184485 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out1619184485| ~y$w_buff1~0_In1619184485) (not .cse1)) (and (= ~y~0_In1619184485 |ULTIMATE.start_main_#t~ite34_Out1619184485|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1619184485, ~y~0=~y~0_In1619184485, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1619184485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1619184485} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1619184485, ~y~0=~y~0_In1619184485, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1619184485, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1619184485|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1619184485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:10:25,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:10:25,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-330215167 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-330215167 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-330215167| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-330215167| ~y$w_buff0_used~0_In-330215167)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-330215167, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-330215167} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-330215167, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-330215167, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-330215167|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:10:25,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In865981320 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In865981320 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In865981320 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In865981320 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In865981320 |ULTIMATE.start_main_#t~ite37_Out865981320|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out865981320|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In865981320, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In865981320, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In865981320, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865981320} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In865981320, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In865981320, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out865981320|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In865981320, ~y$w_buff1_used~0=~y$w_buff1_used~0_In865981320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:10:25,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1530944182 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1530944182 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1530944182| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1530944182| ~y$r_buff0_thd0~0_In-1530944182)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530944182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530944182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530944182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530944182, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1530944182|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:10:25,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1533670047 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1533670047 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1533670047 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1533670047 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1533670047| ~y$r_buff1_thd0~0_In1533670047) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out1533670047| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1533670047, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1533670047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1533670047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533670047} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1533670047, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1533670047|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1533670047, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1533670047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533670047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:10:25,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 1 v_~__unbuffered_p0_EAX~0_21) (= v_~main$tmp_guard1~0_19 0) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:10:25,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:10:25 BasicIcfg [2019-12-18 17:10:25,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:10:25,151 INFO L168 Benchmark]: Toolchain (without parser) took 11474.28 ms. Allocated memory was 144.7 MB in the beginning and 390.6 MB in the end (delta: 245.9 MB). Free memory was 100.3 MB in the beginning and 136.1 MB in the end (delta: -35.7 MB). Peak memory consumption was 210.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,152 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.87 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.1 MB in the beginning and 156.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.43 ms. Allocated memory is still 201.3 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,154 INFO L168 Benchmark]: Boogie Preprocessor took 35.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,155 INFO L168 Benchmark]: RCFGBuilder took 807.58 ms. Allocated memory is still 201.3 MB. Free memory was 151.2 MB in the beginning and 109.8 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,156 INFO L168 Benchmark]: TraceAbstraction took 9843.61 ms. Allocated memory was 201.3 MB in the beginning and 390.6 MB in the end (delta: 189.3 MB). Free memory was 109.1 MB in the beginning and 136.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 162.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:10:25,159 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.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 722.87 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.1 MB in the beginning and 156.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.43 ms. Allocated memory is still 201.3 MB. Free memory was 156.0 MB in the beginning and 153.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.85 ms. Allocated memory is still 201.3 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.58 ms. Allocated memory is still 201.3 MB. Free memory was 151.2 MB in the beginning and 109.8 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9843.61 ms. Allocated memory was 201.3 MB in the beginning and 390.6 MB in the end (delta: 189.3 MB). Free memory was 109.1 MB in the beginning and 136.1 MB in the end (delta: -27.0 MB). Peak memory consumption was 162.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 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 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 786 SDslu, 1665 SDs, 0 SdLazy, 750 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred 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: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 36902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...