/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:23:17,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:23:17,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:23:17,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:23:17,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:23:17,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:23:17,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:23:17,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:23:17,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:23:17,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:23:17,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:23:17,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:23:17,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:23:17,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:23:17,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:23:17,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:23:17,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:23:17,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:23:17,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:23:17,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:23:17,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:23:17,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:23:17,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:23:17,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:23:17,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:23:17,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:23:17,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:23:17,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:23:17,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:23:17,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:23:17,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:23:17,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:23:17,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:23:17,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:23:17,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:23:17,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:23:17,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:23:17,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:23:17,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:23:17,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:23:17,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:23:17,408 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-VariableLbe.epf [2019-12-27 06:23:17,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:23:17,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:23:17,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:23:17,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:23:17,424 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:23:17,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:23:17,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:23:17,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:23:17,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:23:17,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:23:17,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:23:17,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:23:17,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:23:17,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:23:17,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:23:17,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:23:17,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:23:17,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:23:17,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:23:17,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:23:17,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:23:17,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:23:17,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:23:17,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:23:17,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:23:17,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 06:23:17,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37770c5/5ebaac7ec2ad4fd68621e0bb7ab8e2cd/FLAG1d25ce0b4 [2019-12-27 06:23:18,410 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:23:18,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-27 06:23:18,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37770c5/5ebaac7ec2ad4fd68621e0bb7ab8e2cd/FLAG1d25ce0b4 [2019-12-27 06:23:18,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f37770c5/5ebaac7ec2ad4fd68621e0bb7ab8e2cd [2019-12-27 06:23:18,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:23:18,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:23:18,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:18,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:23:18,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:23:18,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:18" (1/1) ... [2019-12-27 06:23:18,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775bc81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:18, skipping insertion in model container [2019-12-27 06:23:18,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:18" (1/1) ... [2019-12-27 06:23:18,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:23:18,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:23:19,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:19,292 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:23:19,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:19,435 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:23:19,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19 WrapperNode [2019-12-27 06:23:19,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:19,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:19,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:23:19,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:23:19,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:19,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:23:19,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:23:19,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:23:19,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... [2019-12-27 06:23:19,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:23:19,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:23:19,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:23:19,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:23:19,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:23:19,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:23:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:23:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:23:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:23:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:23:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:23:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:23:19,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:23:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:23:19,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:23:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:23:19,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:23:19,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:23:19,611 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:23:20,397 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:23:20,397 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:23:20,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:20 BoogieIcfgContainer [2019-12-27 06:23:20,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:23:20,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:23:20,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:23:20,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:23:20,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:23:18" (1/3) ... [2019-12-27 06:23:20,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8c6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:20, skipping insertion in model container [2019-12-27 06:23:20,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:19" (2/3) ... [2019-12-27 06:23:20,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8c6e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:20, skipping insertion in model container [2019-12-27 06:23:20,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:20" (3/3) ... [2019-12-27 06:23:20,407 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-27 06:23:20,417 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:23:20,417 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:23:20,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:23:20,426 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:23:20,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,504 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,504 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,521 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,522 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,532 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:20,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:23:20,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:23:20,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:23:20,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:23:20,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:23:20,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:23:20,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:23:20,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:23:20,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:23:20,588 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:23:20,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:23:20,705 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:23:20,705 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:20,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:23:20,745 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:23:20,837 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:23:20,837 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:20,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:23:20,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 06:23:20,865 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:23:24,093 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:23:24,230 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:23:24,258 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84314 [2019-12-27 06:23:24,258 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:23:24,262 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-27 06:23:44,983 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-27 06:23:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-27 06:23:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:23:44,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:44,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:23:44,995 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash 816355088, now seen corresponding path program 1 times [2019-12-27 06:23:45,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:45,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532469487] [2019-12-27 06:23:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:45,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532469487] [2019-12-27 06:23:45,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:45,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:23:45,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606934463] [2019-12-27 06:23:45,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:45,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:45,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:45,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:45,350 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-27 06:23:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:48,653 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-27 06:23:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:48,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:23:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:49,582 INFO L225 Difference]: With dead ends: 129322 [2019-12-27 06:23:49,583 INFO L226 Difference]: Without dead ends: 126774 [2019-12-27 06:23:49,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-27 06:23:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-27 06:23:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-27 06:24:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-27 06:24:04,179 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-27 06:24:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:04,180 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-27 06:24:04,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-27 06:24:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:24:04,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:04,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:04,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1139031116, now seen corresponding path program 1 times [2019-12-27 06:24:04,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:04,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686936277] [2019-12-27 06:24:04,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:04,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686936277] [2019-12-27 06:24:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:04,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932899141] [2019-12-27 06:24:04,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:04,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:04,312 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 4 states. [2019-12-27 06:24:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:10,338 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-27 06:24:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:10,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:24:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:11,033 INFO L225 Difference]: With dead ends: 198214 [2019-12-27 06:24:11,034 INFO L226 Difference]: Without dead ends: 198165 [2019-12-27 06:24:11,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-27 06:24:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-27 06:24:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-27 06:24:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-27 06:24:22,342 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-27 06:24:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:22,342 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-27 06:24:22,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-27 06:24:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:24:22,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:22,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:22,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:22,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2060782969, now seen corresponding path program 1 times [2019-12-27 06:24:22,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:22,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856332251] [2019-12-27 06:24:22,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:29,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856332251] [2019-12-27 06:24:29,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:29,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:29,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983314711] [2019-12-27 06:24:29,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:29,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:29,097 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-27 06:24:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:31,948 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-27 06:24:31,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:31,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:24:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:32,688 INFO L225 Difference]: With dead ends: 261626 [2019-12-27 06:24:32,688 INFO L226 Difference]: Without dead ends: 261563 [2019-12-27 06:24:32,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-27 06:24:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-27 06:24:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-27 06:24:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-27 06:24:52,271 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-27 06:24:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:52,273 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-27 06:24:52,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-27 06:24:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:24:52,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:52,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:52,277 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1688626962, now seen corresponding path program 1 times [2019-12-27 06:24:52,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:52,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872022697] [2019-12-27 06:24:52,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:52,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872022697] [2019-12-27 06:24:52,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:52,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:52,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880875563] [2019-12-27 06:24:52,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:52,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:52,374 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-27 06:24:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:52,548 INFO L93 Difference]: Finished difference Result 48374 states and 159119 transitions. [2019-12-27 06:24:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:52,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:24:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:52,625 INFO L225 Difference]: With dead ends: 48374 [2019-12-27 06:24:52,625 INFO L226 Difference]: Without dead ends: 43292 [2019-12-27 06:24:52,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43292 states. [2019-12-27 06:24:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43292 to 43292. [2019-12-27 06:24:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43292 states. [2019-12-27 06:24:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43292 states to 43292 states and 140285 transitions. [2019-12-27 06:24:59,790 INFO L78 Accepts]: Start accepts. Automaton has 43292 states and 140285 transitions. Word has length 13 [2019-12-27 06:24:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:59,791 INFO L462 AbstractCegarLoop]: Abstraction has 43292 states and 140285 transitions. [2019-12-27 06:24:59,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 43292 states and 140285 transitions. [2019-12-27 06:24:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:24:59,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:59,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:59,795 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash -22694219, now seen corresponding path program 1 times [2019-12-27 06:24:59,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:59,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528794734] [2019-12-27 06:24:59,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:59,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528794734] [2019-12-27 06:24:59,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:59,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:59,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28881079] [2019-12-27 06:24:59,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:59,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:59,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:59,956 INFO L87 Difference]: Start difference. First operand 43292 states and 140285 transitions. Second operand 5 states. [2019-12-27 06:25:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:00,788 INFO L93 Difference]: Finished difference Result 57766 states and 183516 transitions. [2019-12-27 06:25:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:25:00,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:25:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:00,882 INFO L225 Difference]: With dead ends: 57766 [2019-12-27 06:25:00,882 INFO L226 Difference]: Without dead ends: 57585 [2019-12-27 06:25:00,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:25:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57585 states. [2019-12-27 06:25:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57585 to 43565. [2019-12-27 06:25:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43565 states. [2019-12-27 06:25:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43565 states to 43565 states and 141059 transitions. [2019-12-27 06:25:01,730 INFO L78 Accepts]: Start accepts. Automaton has 43565 states and 141059 transitions. Word has length 19 [2019-12-27 06:25:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:01,730 INFO L462 AbstractCegarLoop]: Abstraction has 43565 states and 141059 transitions. [2019-12-27 06:25:01,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:25:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 43565 states and 141059 transitions. [2019-12-27 06:25:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:25:01,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:01,745 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] [2019-12-27 06:25:01,745 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1635132596, now seen corresponding path program 1 times [2019-12-27 06:25:01,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:01,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90677535] [2019-12-27 06:25:01,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:01,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90677535] [2019-12-27 06:25:01,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:01,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:25:01,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603106697] [2019-12-27 06:25:01,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:25:01,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:01,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:25:01,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:25:01,859 INFO L87 Difference]: Start difference. First operand 43565 states and 141059 transitions. Second operand 5 states. [2019-12-27 06:25:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:01,945 INFO L93 Difference]: Finished difference Result 9157 states and 25258 transitions. [2019-12-27 06:25:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:25:01,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:25:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:01,963 INFO L225 Difference]: With dead ends: 9157 [2019-12-27 06:25:01,963 INFO L226 Difference]: Without dead ends: 8050 [2019-12-27 06:25:01,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:25:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states. [2019-12-27 06:25:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 7910. [2019-12-27 06:25:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7910 states. [2019-12-27 06:25:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 21622 transitions. [2019-12-27 06:25:02,323 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 21622 transitions. Word has length 25 [2019-12-27 06:25:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 7910 states and 21622 transitions. [2019-12-27 06:25:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:25:02,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 21622 transitions. [2019-12-27 06:25:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:25:02,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:02,336 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] [2019-12-27 06:25:02,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1438726867, now seen corresponding path program 1 times [2019-12-27 06:25:02,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:02,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390560928] [2019-12-27 06:25:02,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:02,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390560928] [2019-12-27 06:25:02,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:02,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:25:02,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129221440] [2019-12-27 06:25:02,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:02,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:02,441 INFO L87 Difference]: Start difference. First operand 7910 states and 21622 transitions. Second operand 6 states. [2019-12-27 06:25:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:02,525 INFO L93 Difference]: Finished difference Result 5799 states and 16611 transitions. [2019-12-27 06:25:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:25:02,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 06:25:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:02,534 INFO L225 Difference]: With dead ends: 5799 [2019-12-27 06:25:02,535 INFO L226 Difference]: Without dead ends: 5716 [2019-12-27 06:25:02,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:25:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-12-27 06:25:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5303. [2019-12-27 06:25:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 06:25:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 06:25:02,621 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 37 [2019-12-27 06:25:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:02,622 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 06:25:02,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 06:25:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:25:02,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:02,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:02,630 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:02,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash -285289946, now seen corresponding path program 1 times [2019-12-27 06:25:02,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:02,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147929429] [2019-12-27 06:25:02,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:02,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147929429] [2019-12-27 06:25:02,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:02,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:25:02,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692492003] [2019-12-27 06:25:02,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:02,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:02,707 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-27 06:25:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:02,765 INFO L93 Difference]: Finished difference Result 5313 states and 15339 transitions. [2019-12-27 06:25:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:02,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:25:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:02,774 INFO L225 Difference]: With dead ends: 5313 [2019-12-27 06:25:02,774 INFO L226 Difference]: Without dead ends: 5313 [2019-12-27 06:25:02,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-27 06:25:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5308. [2019-12-27 06:25:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5308 states. [2019-12-27 06:25:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 15334 transitions. [2019-12-27 06:25:02,850 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 15334 transitions. Word has length 65 [2019-12-27 06:25:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:02,850 INFO L462 AbstractCegarLoop]: Abstraction has 5308 states and 15334 transitions. [2019-12-27 06:25:02,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 15334 transitions. [2019-12-27 06:25:02,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:25:02,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:02,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:02,858 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:02,858 INFO L82 PathProgramCache]: Analyzing trace with hash 382965131, now seen corresponding path program 1 times [2019-12-27 06:25:02,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:02,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883396383] [2019-12-27 06:25:02,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:02,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883396383] [2019-12-27 06:25:02,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:02,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:25:02,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973078046] [2019-12-27 06:25:02,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:02,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:02,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:02,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:02,962 INFO L87 Difference]: Start difference. First operand 5308 states and 15334 transitions. Second operand 6 states. [2019-12-27 06:25:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:03,493 INFO L93 Difference]: Finished difference Result 7920 states and 22333 transitions. [2019-12-27 06:25:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:25:03,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 06:25:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:03,504 INFO L225 Difference]: With dead ends: 7920 [2019-12-27 06:25:03,504 INFO L226 Difference]: Without dead ends: 7920 [2019-12-27 06:25:03,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:25:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7920 states. [2019-12-27 06:25:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7920 to 6373. [2019-12-27 06:25:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6373 states. [2019-12-27 06:25:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 18123 transitions. [2019-12-27 06:25:03,606 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 18123 transitions. Word has length 65 [2019-12-27 06:25:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:03,606 INFO L462 AbstractCegarLoop]: Abstraction has 6373 states and 18123 transitions. [2019-12-27 06:25:03,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 18123 transitions. [2019-12-27 06:25:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:25:03,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:03,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:03,615 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2013510165, now seen corresponding path program 2 times [2019-12-27 06:25:03,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:03,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567797081] [2019-12-27 06:25:03,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:03,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567797081] [2019-12-27 06:25:03,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:03,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:03,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548438374] [2019-12-27 06:25:03,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:03,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:03,773 INFO L87 Difference]: Start difference. First operand 6373 states and 18123 transitions. Second operand 3 states. [2019-12-27 06:25:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:03,809 INFO L93 Difference]: Finished difference Result 6061 states and 17063 transitions. [2019-12-27 06:25:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:03,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:25:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:03,819 INFO L225 Difference]: With dead ends: 6061 [2019-12-27 06:25:03,819 INFO L226 Difference]: Without dead ends: 6061 [2019-12-27 06:25:03,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2019-12-27 06:25:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 5893. [2019-12-27 06:25:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5893 states. [2019-12-27 06:25:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 16611 transitions. [2019-12-27 06:25:03,935 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 16611 transitions. Word has length 65 [2019-12-27 06:25:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:03,936 INFO L462 AbstractCegarLoop]: Abstraction has 5893 states and 16611 transitions. [2019-12-27 06:25:03,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 16611 transitions. [2019-12-27 06:25:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:25:03,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:03,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:03,948 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash -730876238, now seen corresponding path program 1 times [2019-12-27 06:25:03,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:03,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291001082] [2019-12-27 06:25:03,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:04,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291001082] [2019-12-27 06:25:04,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:04,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:04,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090140831] [2019-12-27 06:25:04,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:04,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:04,116 INFO L87 Difference]: Start difference. First operand 5893 states and 16611 transitions. Second operand 3 states. [2019-12-27 06:25:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:04,190 INFO L93 Difference]: Finished difference Result 5892 states and 16609 transitions. [2019-12-27 06:25:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:04,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:25:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:04,199 INFO L225 Difference]: With dead ends: 5892 [2019-12-27 06:25:04,200 INFO L226 Difference]: Without dead ends: 5892 [2019-12-27 06:25:04,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2019-12-27 06:25:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 3847. [2019-12-27 06:25:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3847 states. [2019-12-27 06:25:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 10980 transitions. [2019-12-27 06:25:04,284 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 10980 transitions. Word has length 66 [2019-12-27 06:25:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:04,284 INFO L462 AbstractCegarLoop]: Abstraction has 3847 states and 10980 transitions. [2019-12-27 06:25:04,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 10980 transitions. [2019-12-27 06:25:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:25:04,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:04,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:04,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 350380320, now seen corresponding path program 1 times [2019-12-27 06:25:04,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:04,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219527616] [2019-12-27 06:25:04,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:04,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219527616] [2019-12-27 06:25:04,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:04,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:25:04,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090198148] [2019-12-27 06:25:04,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:04,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:04,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:04,414 INFO L87 Difference]: Start difference. First operand 3847 states and 10980 transitions. Second operand 6 states. [2019-12-27 06:25:04,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:04,486 INFO L93 Difference]: Finished difference Result 6730 states and 19208 transitions. [2019-12-27 06:25:04,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:25:04,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 06:25:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:04,492 INFO L225 Difference]: With dead ends: 6730 [2019-12-27 06:25:04,492 INFO L226 Difference]: Without dead ends: 3226 [2019-12-27 06:25:04,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:25:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2019-12-27 06:25:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2019-12-27 06:25:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3226 states. [2019-12-27 06:25:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 9162 transitions. [2019-12-27 06:25:04,559 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 9162 transitions. Word has length 67 [2019-12-27 06:25:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:04,560 INFO L462 AbstractCegarLoop]: Abstraction has 3226 states and 9162 transitions. [2019-12-27 06:25:04,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 9162 transitions. [2019-12-27 06:25:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:25:04,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:04,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:04,566 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash -124844872, now seen corresponding path program 2 times [2019-12-27 06:25:04,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:04,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362902554] [2019-12-27 06:25:04,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:04,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362902554] [2019-12-27 06:25:04,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:04,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:25:04,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009217805] [2019-12-27 06:25:04,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:25:04,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:04,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:25:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:25:04,692 INFO L87 Difference]: Start difference. First operand 3226 states and 9162 transitions. Second operand 6 states. [2019-12-27 06:25:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:05,250 INFO L93 Difference]: Finished difference Result 5374 states and 15019 transitions. [2019-12-27 06:25:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:25:05,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 06:25:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:05,259 INFO L225 Difference]: With dead ends: 5374 [2019-12-27 06:25:05,259 INFO L226 Difference]: Without dead ends: 5374 [2019-12-27 06:25:05,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:25:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2019-12-27 06:25:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 3212. [2019-12-27 06:25:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2019-12-27 06:25:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 9122 transitions. [2019-12-27 06:25:05,323 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 9122 transitions. Word has length 67 [2019-12-27 06:25:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:05,324 INFO L462 AbstractCegarLoop]: Abstraction has 3212 states and 9122 transitions. [2019-12-27 06:25:05,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:25:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 9122 transitions. [2019-12-27 06:25:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:25:05,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:05,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:05,329 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1519841048, now seen corresponding path program 3 times [2019-12-27 06:25:05,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:05,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609981118] [2019-12-27 06:25:05,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:05,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609981118] [2019-12-27 06:25:05,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:05,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:25:05,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677179731] [2019-12-27 06:25:05,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:25:05,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:25:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:05,446 INFO L87 Difference]: Start difference. First operand 3212 states and 9122 transitions. Second operand 3 states. [2019-12-27 06:25:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:05,468 INFO L93 Difference]: Finished difference Result 3036 states and 8460 transitions. [2019-12-27 06:25:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:25:05,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:25:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:05,473 INFO L225 Difference]: With dead ends: 3036 [2019-12-27 06:25:05,473 INFO L226 Difference]: Without dead ends: 3036 [2019-12-27 06:25:05,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:25:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2019-12-27 06:25:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2822. [2019-12-27 06:25:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2019-12-27 06:25:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 7862 transitions. [2019-12-27 06:25:05,520 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 7862 transitions. Word has length 67 [2019-12-27 06:25:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:05,520 INFO L462 AbstractCegarLoop]: Abstraction has 2822 states and 7862 transitions. [2019-12-27 06:25:05,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:25:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 7862 transitions. [2019-12-27 06:25:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:25:05,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:05,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:05,525 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1954092807, now seen corresponding path program 1 times [2019-12-27 06:25:05,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:05,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618454215] [2019-12-27 06:25:05,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:25:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:25:05,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618454215] [2019-12-27 06:25:05,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:25:05,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:25:05,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049594762] [2019-12-27 06:25:05,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:25:05,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:25:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:25:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:25:05,747 INFO L87 Difference]: Start difference. First operand 2822 states and 7862 transitions. Second operand 14 states. [2019-12-27 06:25:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:25:06,419 INFO L93 Difference]: Finished difference Result 4923 states and 13596 transitions. [2019-12-27 06:25:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:25:06,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 06:25:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:25:06,425 INFO L225 Difference]: With dead ends: 4923 [2019-12-27 06:25:06,426 INFO L226 Difference]: Without dead ends: 4892 [2019-12-27 06:25:06,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:25:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2019-12-27 06:25:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4058. [2019-12-27 06:25:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4058 states. [2019-12-27 06:25:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 11202 transitions. [2019-12-27 06:25:06,485 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 11202 transitions. Word has length 68 [2019-12-27 06:25:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:25:06,485 INFO L462 AbstractCegarLoop]: Abstraction has 4058 states and 11202 transitions. [2019-12-27 06:25:06,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:25:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 11202 transitions. [2019-12-27 06:25:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:25:06,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:25:06,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:25:06,491 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:25:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:25:06,492 INFO L82 PathProgramCache]: Analyzing trace with hash -424200247, now seen corresponding path program 2 times [2019-12-27 06:25:06,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:25:06,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112447135] [2019-12-27 06:25:06,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:25:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:25:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:25:06,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:25:06,634 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:25:06,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~a~0_9) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$w_buff1~0_23) (= 0 v_~x$r_buff0_thd1~0_20) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= 0 v_~x$r_buff0_thd2~0_27) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= v_~x$flush_delayed~0_16 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$w_buff0~0_26) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~z~0_7) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= v_~x$r_buff1_thd1~0_18 0) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$r_buff1_thd3~0_18 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~x$w_buff0_used~0_114) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~y~0_11 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard1~0_13 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_15|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_17|, ~a~0=v_~a~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_23, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_17|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_27, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:25:06,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-27 06:25:06,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L4-->L768: Formula: (and (= ~x$r_buff0_thd2~0_Out310870281 1) (= ~x$r_buff1_thd3~0_Out310870281 ~x$r_buff0_thd3~0_In310870281) (= ~x$r_buff0_thd0~0_In310870281 ~x$r_buff1_thd0~0_Out310870281) (= ~__unbuffered_p1_EAX~0_Out310870281 ~y~0_In310870281) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In310870281 0)) (= ~x$r_buff1_thd1~0_Out310870281 ~x$r_buff0_thd1~0_In310870281) (= ~x$r_buff1_thd2~0_Out310870281 ~x$r_buff0_thd2~0_In310870281)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In310870281, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In310870281, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In310870281, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In310870281, ~y~0=~y~0_In310870281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In310870281} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In310870281, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In310870281, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In310870281, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out310870281, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out310870281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out310870281, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out310870281, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In310870281, ~y~0=~y~0_In310870281, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out310870281, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out310870281} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:25:06,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-925268039 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-925268039 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-925268039|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-925268039 |P1Thread1of1ForFork1_#t~ite11_Out-925268039|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-925268039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-925268039} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-925268039|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-925268039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-925268039} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:25:06,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-192142972 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-192142972 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-192142972 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-192142972 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-192142972 |P1Thread1of1ForFork1_#t~ite12_Out-192142972|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-192142972|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-192142972, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-192142972, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-192142972, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192142972} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-192142972, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-192142972, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-192142972|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-192142972, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-192142972} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:25:06,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-27 06:25:06,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In315174509 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In315174509 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out315174509| ~x$w_buff1~0_In315174509) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out315174509| ~x~0_In315174509)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In315174509, ~x$w_buff1_used~0=~x$w_buff1_used~0_In315174509, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In315174509, ~x~0=~x~0_In315174509} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out315174509|, ~x$w_buff1~0=~x$w_buff1~0_In315174509, ~x$w_buff1_used~0=~x$w_buff1_used~0_In315174509, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In315174509, ~x~0=~x~0_In315174509} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 06:25:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 06:25:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1679768182 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1679768182 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1679768182 |P0Thread1of1ForFork0_#t~ite3_Out1679768182|)) (and (or .cse0 .cse1) (= ~x~0_In1679768182 |P0Thread1of1ForFork0_#t~ite3_Out1679768182|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1679768182, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679768182, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1679768182, ~x~0=~x~0_In1679768182} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1679768182|, ~x$w_buff1~0=~x$w_buff1~0_In1679768182, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1679768182, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1679768182, ~x~0=~x~0_In1679768182} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 06:25:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_18 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 06:25:06,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In232565742 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In232565742 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out232565742|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In232565742 |P2Thread1of1ForFork2_#t~ite17_Out232565742|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In232565742, ~x$w_buff0_used~0=~x$w_buff0_used~0_In232565742} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In232565742, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out232565742|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In232565742} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 06:25:06,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1754723528 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1754723528 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1754723528 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1754723528 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out1754723528| ~x$w_buff1_used~0_In1754723528)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out1754723528| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1754723528, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1754723528, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1754723528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754723528} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1754723528, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1754723528, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1754723528, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1754723528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754723528} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 06:25:06,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In831070320 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In831070320 256)))) (or (and (= ~x$r_buff0_thd3~0_In831070320 |P2Thread1of1ForFork2_#t~ite19_Out831070320|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out831070320|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In831070320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831070320} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In831070320, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out831070320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In831070320} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 06:25:06,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In296459671 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In296459671 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In296459671 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In296459671 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In296459671 |P2Thread1of1ForFork2_#t~ite20_Out296459671|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out296459671|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In296459671, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In296459671, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In296459671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296459671} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out296459671|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In296459671, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In296459671, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In296459671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296459671} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 06:25:06,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L798-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:25:06,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2143013415 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2143013415 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2143013415| ~x$w_buff0_used~0_In-2143013415)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2143013415| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2143013415, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143013415} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2143013415|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2143013415, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143013415} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:25:06,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1231571684 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1231571684 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1231571684 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1231571684 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1231571684| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1231571684 |P0Thread1of1ForFork0_#t~ite6_Out1231571684|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1231571684, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1231571684, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1231571684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1231571684} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1231571684|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1231571684, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1231571684, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1231571684, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1231571684} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:25:06,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2072309710 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2072309710 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-2072309710| ~x$r_buff0_thd1~0_In-2072309710)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-2072309710| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2072309710, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2072309710} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2072309710, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2072309710|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2072309710} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:25:06,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In161081047 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In161081047 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In161081047 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In161081047 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out161081047|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In161081047 |P0Thread1of1ForFork0_#t~ite8_Out161081047|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In161081047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In161081047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In161081047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In161081047} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In161081047, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out161081047|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In161081047, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In161081047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In161081047} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:25:06,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:25:06,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1588036052 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1588036052 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1588036052 ~x$r_buff0_thd2~0_In-1588036052)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out-1588036052 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1588036052, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1588036052} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1588036052|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1588036052, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1588036052} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:25:06,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1885489968 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1885489968 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1885489968 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1885489968 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1885489968|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1885489968| ~x$r_buff1_thd2~0_In1885489968) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1885489968, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1885489968, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1885489968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885489968} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1885489968, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1885489968, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1885489968, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1885489968|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1885489968} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:25:06,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L772-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:25:06,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_46 256)) (= (mod v_~x$w_buff0_used~0_80 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:25:06,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-537087848 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-537087848 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-537087848| ~x$w_buff1~0_In-537087848)) (and (or .cse0 .cse1) (= ~x~0_In-537087848 |ULTIMATE.start_main_#t~ite24_Out-537087848|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-537087848, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-537087848, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-537087848, ~x~0=~x~0_In-537087848} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-537087848, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-537087848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-537087848, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-537087848, ~x~0=~x~0_In-537087848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:25:06,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_22 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-27 06:25:06,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In336301992 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In336301992 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out336301992| ~x$w_buff0_used~0_In336301992)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out336301992| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In336301992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In336301992} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In336301992, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out336301992|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In336301992} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 06:25:06,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-763151446 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-763151446 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-763151446 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-763151446 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-763151446| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-763151446| ~x$w_buff1_used~0_In-763151446)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-763151446, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-763151446, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-763151446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-763151446} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-763151446, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-763151446, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-763151446|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-763151446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-763151446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 06:25:06,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1025390476 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1025390476 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out1025390476| ~x$r_buff0_thd0~0_In1025390476) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1025390476| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1025390476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1025390476} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1025390476, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1025390476|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1025390476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 06:25:06,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1825189394 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1825189394 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1825189394 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1825189394 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1825189394| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite29_Out-1825189394| ~x$r_buff1_thd0~0_In-1825189394) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1825189394, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1825189394, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1825189394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1825189394} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1825189394, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1825189394|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1825189394, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1825189394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1825189394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:25:06,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:25:06,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L844-->L844-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2068887839 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-2068887839| |ULTIMATE.start_main_#t~ite50_Out-2068887839|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2068887839 256) 0))) (or (and .cse1 (= (mod ~x$r_buff1_thd0~0_In-2068887839 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-2068887839 256)) (and (= (mod ~x$w_buff1_used~0_In-2068887839 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite50_Out-2068887839| ~x$r_buff1_thd0~0_In-2068887839)) (and (= |ULTIMATE.start_main_#t~ite50_In-2068887839| |ULTIMATE.start_main_#t~ite50_Out-2068887839|) (= |ULTIMATE.start_main_#t~ite51_Out-2068887839| ~x$r_buff1_thd0~0_In-2068887839) (not .cse0)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-2068887839|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2068887839, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068887839, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2068887839, ~weak$$choice2~0=~weak$$choice2~0_In-2068887839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068887839} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2068887839|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2068887839, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2068887839|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068887839, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2068887839, ~weak$$choice2~0=~weak$$choice2~0_In-2068887839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068887839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:25:06,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L846-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_25) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:25:06,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:25:06,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:25:06 BasicIcfg [2019-12-27 06:25:06,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:25:06,764 INFO L168 Benchmark]: Toolchain (without parser) took 108098.26 ms. Allocated memory was 144.7 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,765 INFO L168 Benchmark]: CDTParser took 0.18 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.44 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.43 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,767 INFO L168 Benchmark]: Boogie Preprocessor took 40.63 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,768 INFO L168 Benchmark]: RCFGBuilder took 856.17 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 99.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,768 INFO L168 Benchmark]: TraceAbstraction took 106362.38 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 98.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:25:06,772 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.18 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.44 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.2 MB in the end (delta: -55.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.43 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.63 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.17 ms. Allocated memory is still 201.9 MB. Free memory was 149.2 MB in the beginning and 99.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106362.38 ms. Allocated memory was 201.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 98.7 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 30 ChoiceCompositions, 5872 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84314 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L839] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L841] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2393 SDtfs, 2296 SDslu, 4997 SDs, 0 SdLazy, 2266 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223048occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 74960 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 721 NumberOfCodeBlocks, 721 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 148900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...