/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:37:20,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:37:20,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:37:20,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:37:20,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:37:20,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:37:20,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:37:20,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:37:20,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:37:20,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:37:20,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:37:20,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:37:20,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:37:20,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:37:20,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:37:20,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:37:20,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:37:20,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:37:20,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:37:20,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:37:20,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:37:20,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:37:20,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:37:20,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:37:20,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:37:20,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:37:20,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:37:20,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:37:20,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:37:20,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:37:20,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:37:20,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:37:20,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:37:20,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:37:20,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:37:20,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:37:20,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:37:20,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:37:20,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:37:20,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:37:20,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:37:20,322 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-MCR.epf [2019-12-27 21:37:20,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:37:20,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:37:20,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:37:20,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:37:20,350 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:37:20,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:37:20,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:37:20,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:37:20,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:37:20,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:37:20,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:37:20,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:37:20,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:37:20,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:37:20,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:37:20,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:37:20,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:37:20,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:37:20,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:37:20,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:37:20,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:37:20,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:37:20,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:37:20,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:37:20,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:37:20,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:37:20,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:37:20,356 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:37:20,356 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:37:20,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:37:20,357 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:37:20,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:37:20,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:37:20,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:37:20,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:37:20,672 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:37:20,673 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:37:20,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-27 21:37:20,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e8aadf6/f0eb34df565949f78870874c8672d5f3/FLAGb41e8da4c [2019-12-27 21:37:21,293 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:37:21,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-27 21:37:21,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e8aadf6/f0eb34df565949f78870874c8672d5f3/FLAGb41e8da4c [2019-12-27 21:37:21,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e8aadf6/f0eb34df565949f78870874c8672d5f3 [2019-12-27 21:37:21,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:37:21,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:37:21,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:21,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:37:21,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:37:21,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:21" (1/1) ... [2019-12-27 21:37:21,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb22c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:21, skipping insertion in model container [2019-12-27 21:37:21,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:21" (1/1) ... [2019-12-27 21:37:21,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:37:21,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:37:22,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:22,226 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:37:22,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:22,408 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:37:22,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22 WrapperNode [2019-12-27 21:37:22,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:22,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:22,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:37:22,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:37:22,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:22,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:37:22,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:37:22,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:37:22,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:37:22,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:37:22,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:37:22,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:37:22,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (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 21:37:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:37:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:37:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:37:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:37:22,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:37:22,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:37:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:37:22,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:37:22,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:37:22,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:37:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:37:22,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:37:22,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:37:22,604 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 21:37:23,416 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:37:23,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:37:23,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:23 BoogieIcfgContainer [2019-12-27 21:37:23,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:37:23,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:37:23,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:37:23,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:37:23,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:37:21" (1/3) ... [2019-12-27 21:37:23,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4f13d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:23, skipping insertion in model container [2019-12-27 21:37:23,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (2/3) ... [2019-12-27 21:37:23,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4f13d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:23, skipping insertion in model container [2019-12-27 21:37:23,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:23" (3/3) ... [2019-12-27 21:37:23,431 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2019-12-27 21:37:23,443 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:37:23,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:37:23,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:37:23,456 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:37:23,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,524 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:37:23,608 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:37:23,609 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:37:23,609 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:37:23,609 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:37:23,609 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:37:23,609 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:37:23,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:37:23,610 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:37:23,626 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 21:37:23,628 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:37:23,732 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:37:23,732 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:23,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:37:23,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:37:23,830 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:37:23,830 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:23,838 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:37:23,857 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 21:37:23,858 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:37:27,051 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-27 21:37:27,160 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-27 21:37:27,316 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:37:27,435 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 21:37:27,466 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91912 [2019-12-27 21:37:27,466 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:37:27,470 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 101 transitions [2019-12-27 21:37:45,273 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115110 states. [2019-12-27 21:37:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 115110 states. [2019-12-27 21:37:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:37:45,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:45,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:37:45,281 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 21:37:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 815308427, now seen corresponding path program 1 times [2019-12-27 21:37:45,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:45,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712217604] [2019-12-27 21:37:45,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:45,622 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 21:37:45,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712217604] [2019-12-27 21:37:45,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:45,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:37:45,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1338551874] [2019-12-27 21:37:45,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:45,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:45,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:37:45,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:45,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:45,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:45,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:45,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:45,666 INFO L87 Difference]: Start difference. First operand 115110 states. Second operand 3 states. [2019-12-27 21:37:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:48,708 INFO L93 Difference]: Finished difference Result 114720 states and 487546 transitions. [2019-12-27 21:37:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:48,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:37:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:49,593 INFO L225 Difference]: With dead ends: 114720 [2019-12-27 21:37:49,593 INFO L226 Difference]: Without dead ends: 112172 [2019-12-27 21:37:49,595 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 21:37:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112172 states. [2019-12-27 21:37:58,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112172 to 112172. [2019-12-27 21:37:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112172 states. [2019-12-27 21:38:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112172 states to 112172 states and 477158 transitions. [2019-12-27 21:38:01,987 INFO L78 Accepts]: Start accepts. Automaton has 112172 states and 477158 transitions. Word has length 5 [2019-12-27 21:38:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:01,987 INFO L462 AbstractCegarLoop]: Abstraction has 112172 states and 477158 transitions. [2019-12-27 21:38:01,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 112172 states and 477158 transitions. [2019-12-27 21:38:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:38:01,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:01,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:01,992 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 21:38:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1970067083, now seen corresponding path program 1 times [2019-12-27 21:38:01,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:01,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19010041] [2019-12-27 21:38:01,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:02,069 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 21:38:02,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19010041] [2019-12-27 21:38:02,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:02,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:02,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696934979] [2019-12-27 21:38:02,070 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:02,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:02,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:38:02,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:02,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:38:02,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:02,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:02,117 INFO L87 Difference]: Start difference. First operand 112172 states and 477158 transitions. Second operand 5 states. [2019-12-27 21:38:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:07,643 INFO L93 Difference]: Finished difference Result 175422 states and 718454 transitions. [2019-12-27 21:38:07,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:07,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:38:07,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:08,254 INFO L225 Difference]: With dead ends: 175422 [2019-12-27 21:38:08,255 INFO L226 Difference]: Without dead ends: 175373 [2019-12-27 21:38:08,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175373 states. [2019-12-27 21:38:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175373 to 159145. [2019-12-27 21:38:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159145 states. [2019-12-27 21:38:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159145 states to 159145 states and 659586 transitions. [2019-12-27 21:38:22,585 INFO L78 Accepts]: Start accepts. Automaton has 159145 states and 659586 transitions. Word has length 11 [2019-12-27 21:38:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 159145 states and 659586 transitions. [2019-12-27 21:38:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 159145 states and 659586 transitions. [2019-12-27 21:38:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:38:22,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:22,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:22,592 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 21:38:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -590582251, now seen corresponding path program 1 times [2019-12-27 21:38:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:22,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643533460] [2019-12-27 21:38:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:22,675 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 21:38:22,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643533460] [2019-12-27 21:38:22,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:22,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:22,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768200230] [2019-12-27 21:38:22,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:22,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:22,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:38:22,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:22,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:22,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:38:22,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:22,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:38:22,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:22,680 INFO L87 Difference]: Start difference. First operand 159145 states and 659586 transitions. Second operand 4 states. [2019-12-27 21:38:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:25,730 INFO L93 Difference]: Finished difference Result 228110 states and 923913 transitions. [2019-12-27 21:38:25,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:25,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 21:38:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:26,422 INFO L225 Difference]: With dead ends: 228110 [2019-12-27 21:38:26,423 INFO L226 Difference]: Without dead ends: 228047 [2019-12-27 21:38:26,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228047 states. [2019-12-27 21:38:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228047 to 192443. [2019-12-27 21:38:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192443 states. [2019-12-27 21:38:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192443 states to 192443 states and 792052 transitions. [2019-12-27 21:38:42,535 INFO L78 Accepts]: Start accepts. Automaton has 192443 states and 792052 transitions. Word has length 13 [2019-12-27 21:38:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:42,536 INFO L462 AbstractCegarLoop]: Abstraction has 192443 states and 792052 transitions. [2019-12-27 21:38:42,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:38:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 192443 states and 792052 transitions. [2019-12-27 21:38:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:38:42,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:42,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:38:42,541 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 21:38:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash 339341104, now seen corresponding path program 1 times [2019-12-27 21:38:42,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:42,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541491627] [2019-12-27 21:38:42,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:42,588 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 21:38:42,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541491627] [2019-12-27 21:38:42,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:42,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:42,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410452936] [2019-12-27 21:38:42,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:42,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:42,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:38:42,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:42,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:42,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:42,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:42,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:42,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:42,594 INFO L87 Difference]: Start difference. First operand 192443 states and 792052 transitions. Second operand 3 states. [2019-12-27 21:38:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:42,741 INFO L93 Difference]: Finished difference Result 37880 states and 121975 transitions. [2019-12-27 21:38:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:42,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:38:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:42,799 INFO L225 Difference]: With dead ends: 37880 [2019-12-27 21:38:42,799 INFO L226 Difference]: Without dead ends: 37880 [2019-12-27 21:38:42,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37880 states. [2019-12-27 21:38:44,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37880 to 37880. [2019-12-27 21:38:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37880 states. [2019-12-27 21:38:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37880 states to 37880 states and 121975 transitions. [2019-12-27 21:38:44,771 INFO L78 Accepts]: Start accepts. Automaton has 37880 states and 121975 transitions. Word has length 13 [2019-12-27 21:38:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:44,772 INFO L462 AbstractCegarLoop]: Abstraction has 37880 states and 121975 transitions. [2019-12-27 21:38:44,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37880 states and 121975 transitions. [2019-12-27 21:38:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 21:38:44,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:44,776 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 21:38:44,776 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 21:38:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1793457831, now seen corresponding path program 1 times [2019-12-27 21:38:44,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:44,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552313245] [2019-12-27 21:38:44,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:38:44,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552313245] [2019-12-27 21:38:44,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:44,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:44,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163539203] [2019-12-27 21:38:44,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:44,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:44,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 77 transitions. [2019-12-27 21:38:44,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:44,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:38:44,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:38:44,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:38:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:38:44,992 INFO L87 Difference]: Start difference. First operand 37880 states and 121975 transitions. Second operand 7 states. [2019-12-27 21:38:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:45,810 INFO L93 Difference]: Finished difference Result 51102 states and 161291 transitions. [2019-12-27 21:38:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:38:45,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 21:38:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:45,888 INFO L225 Difference]: With dead ends: 51102 [2019-12-27 21:38:45,889 INFO L226 Difference]: Without dead ends: 51089 [2019-12-27 21:38:45,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:38:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51089 states. [2019-12-27 21:38:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51089 to 38340. [2019-12-27 21:38:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-27 21:38:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 123285 transitions. [2019-12-27 21:38:46,609 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 123285 transitions. Word has length 19 [2019-12-27 21:38:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:46,610 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 123285 transitions. [2019-12-27 21:38:46,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:38:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 123285 transitions. [2019-12-27 21:38:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:38:46,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:46,624 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 21:38:46,625 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 21:38:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1227724886, now seen corresponding path program 1 times [2019-12-27 21:38:46,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:46,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499952875] [2019-12-27 21:38:46,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:46,733 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 21:38:46,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499952875] [2019-12-27 21:38:46,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:46,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:46,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875511234] [2019-12-27 21:38:46,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:46,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:46,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 21:38:46,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:46,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:38:46,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:38:46,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:38:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:46,786 INFO L87 Difference]: Start difference. First operand 38340 states and 123285 transitions. Second operand 6 states. [2019-12-27 21:38:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:46,852 INFO L93 Difference]: Finished difference Result 7755 states and 21286 transitions. [2019-12-27 21:38:46,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:38:46,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:38:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:46,863 INFO L225 Difference]: With dead ends: 7755 [2019-12-27 21:38:46,863 INFO L226 Difference]: Without dead ends: 7755 [2019-12-27 21:38:46,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-27 21:38:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7615. [2019-12-27 21:38:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7615 states. [2019-12-27 21:38:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7615 states to 7615 states and 20886 transitions. [2019-12-27 21:38:46,979 INFO L78 Accepts]: Start accepts. Automaton has 7615 states and 20886 transitions. Word has length 25 [2019-12-27 21:38:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:46,980 INFO L462 AbstractCegarLoop]: Abstraction has 7615 states and 20886 transitions. [2019-12-27 21:38:46,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:38:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7615 states and 20886 transitions. [2019-12-27 21:38:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 21:38:46,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:46,992 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 21:38:46,992 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 21:38:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 287382448, now seen corresponding path program 1 times [2019-12-27 21:38:46,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:46,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585169042] [2019-12-27 21:38:46,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:47,091 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 21:38:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585169042] [2019-12-27 21:38:47,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:47,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:38:47,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706069348] [2019-12-27 21:38:47,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:47,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:48,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 109 transitions. [2019-12-27 21:38:48,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:48,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:48,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:48,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:48,297 INFO L87 Difference]: Start difference. First operand 7615 states and 20886 transitions. Second operand 5 states. [2019-12-27 21:38:48,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:48,362 INFO L93 Difference]: Finished difference Result 5711 states and 16438 transitions. [2019-12-27 21:38:48,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:38:48,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 21:38:48,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:48,371 INFO L225 Difference]: With dead ends: 5711 [2019-12-27 21:38:48,372 INFO L226 Difference]: Without dead ends: 5711 [2019-12-27 21:38:48,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-12-27 21:38:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 5298. [2019-12-27 21:38:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5298 states. [2019-12-27 21:38:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 15321 transitions. [2019-12-27 21:38:48,460 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 15321 transitions. Word has length 37 [2019-12-27 21:38:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:48,460 INFO L462 AbstractCegarLoop]: Abstraction has 5298 states and 15321 transitions. [2019-12-27 21:38:48,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 15321 transitions. [2019-12-27 21:38:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:48,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:48,469 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 21:38:48,469 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 21:38:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:48,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2078347018, now seen corresponding path program 1 times [2019-12-27 21:38:48,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:48,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262078232] [2019-12-27 21:38:48,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:48,542 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 21:38:48,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262078232] [2019-12-27 21:38:48,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:48,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:38:48,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102095179] [2019-12-27 21:38:48,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:48,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:48,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 251 transitions. [2019-12-27 21:38:48,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:48,670 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:48,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:48,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:48,671 INFO L87 Difference]: Start difference. First operand 5298 states and 15321 transitions. Second operand 3 states. [2019-12-27 21:38:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:48,737 INFO L93 Difference]: Finished difference Result 5309 states and 15335 transitions. [2019-12-27 21:38:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:48,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:38:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:48,745 INFO L225 Difference]: With dead ends: 5309 [2019-12-27 21:38:48,746 INFO L226 Difference]: Without dead ends: 5309 [2019-12-27 21:38:48,746 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 21:38:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-27 21:38:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5303. [2019-12-27 21:38:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-27 21:38:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-27 21:38:48,822 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 65 [2019-12-27 21:38:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:48,823 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-27 21:38:48,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-27 21:38:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:48,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:48,831 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 21:38:48,831 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 21:38:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1997644654, now seen corresponding path program 1 times [2019-12-27 21:38:48,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:48,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035621826] [2019-12-27 21:38:48,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:48,956 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 21:38:48,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035621826] [2019-12-27 21:38:48,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:48,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:38:48,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294230075] [2019-12-27 21:38:48,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:48,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:49,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 251 transitions. [2019-12-27 21:38:49,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:49,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:38:49,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:38:49,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:38:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:38:49,137 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 5 states. [2019-12-27 21:38:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:49,443 INFO L93 Difference]: Finished difference Result 7796 states and 22302 transitions. [2019-12-27 21:38:49,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:38:49,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:38:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:49,454 INFO L225 Difference]: With dead ends: 7796 [2019-12-27 21:38:49,455 INFO L226 Difference]: Without dead ends: 7796 [2019-12-27 21:38:49,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:38:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7796 states. [2019-12-27 21:38:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7796 to 6602. [2019-12-27 21:38:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6602 states. [2019-12-27 21:38:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 19072 transitions. [2019-12-27 21:38:49,550 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 19072 transitions. Word has length 65 [2019-12-27 21:38:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:49,551 INFO L462 AbstractCegarLoop]: Abstraction has 6602 states and 19072 transitions. [2019-12-27 21:38:49,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:38:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 19072 transitions. [2019-12-27 21:38:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:38:49,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:49,560 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 21:38:49,560 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 21:38:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 777354286, now seen corresponding path program 2 times [2019-12-27 21:38:49,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:49,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416859021] [2019-12-27 21:38:49,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:49,629 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 21:38:49,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416859021] [2019-12-27 21:38:49,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:49,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:49,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781550062] [2019-12-27 21:38:49,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:49,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:50,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 658 transitions. [2019-12-27 21:38:50,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:50,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:38:50,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:38:50,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:50,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:38:50,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:50,923 INFO L87 Difference]: Start difference. First operand 6602 states and 19072 transitions. Second operand 4 states. [2019-12-27 21:38:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:50,963 INFO L93 Difference]: Finished difference Result 6218 states and 17684 transitions. [2019-12-27 21:38:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:50,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 21:38:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:50,970 INFO L225 Difference]: With dead ends: 6218 [2019-12-27 21:38:50,970 INFO L226 Difference]: Without dead ends: 6218 [2019-12-27 21:38:50,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:38:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6218 states. [2019-12-27 21:38:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6218 to 6062. [2019-12-27 21:38:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6062 states. [2019-12-27 21:38:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 17254 transitions. [2019-12-27 21:38:51,057 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 17254 transitions. Word has length 65 [2019-12-27 21:38:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:51,058 INFO L462 AbstractCegarLoop]: Abstraction has 6062 states and 17254 transitions. [2019-12-27 21:38:51,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:38:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 17254 transitions. [2019-12-27 21:38:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:38:51,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:51,070 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 21:38:51,070 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 21:38:51,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:51,070 INFO L82 PathProgramCache]: Analyzing trace with hash 997904129, now seen corresponding path program 1 times [2019-12-27 21:38:51,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:51,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430445527] [2019-12-27 21:38:51,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:51,172 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 21:38:51,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430445527] [2019-12-27 21:38:51,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:51,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:51,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389801110] [2019-12-27 21:38:51,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:51,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:51,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 290 states and 619 transitions. [2019-12-27 21:38:51,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:51,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:51,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:51,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:51,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:51,424 INFO L87 Difference]: Start difference. First operand 6062 states and 17254 transitions. Second operand 3 states. [2019-12-27 21:38:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:51,476 INFO L93 Difference]: Finished difference Result 6062 states and 17253 transitions. [2019-12-27 21:38:51,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:51,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:38:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:51,485 INFO L225 Difference]: With dead ends: 6062 [2019-12-27 21:38:51,485 INFO L226 Difference]: Without dead ends: 6062 [2019-12-27 21:38:51,485 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 21:38:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2019-12-27 21:38:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 4053. [2019-12-27 21:38:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-12-27 21:38:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 11712 transitions. [2019-12-27 21:38:51,553 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 11712 transitions. Word has length 66 [2019-12-27 21:38:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:51,554 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 11712 transitions. [2019-12-27 21:38:51,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 11712 transitions. [2019-12-27 21:38:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:38:51,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:51,559 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 21:38:51,559 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 21:38:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1165773071, now seen corresponding path program 1 times [2019-12-27 21:38:51,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:51,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823579215] [2019-12-27 21:38:51,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:51,721 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 21:38:51,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823579215] [2019-12-27 21:38:51,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:51,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:38:51,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272497304] [2019-12-27 21:38:51,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:51,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:51,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 213 transitions. [2019-12-27 21:38:51,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:51,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:38:51,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:38:51,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:38:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:38:51,925 INFO L87 Difference]: Start difference. First operand 4053 states and 11712 transitions. Second operand 8 states. [2019-12-27 21:38:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:52,069 INFO L93 Difference]: Finished difference Result 7536 states and 21869 transitions. [2019-12-27 21:38:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:38:52,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 21:38:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:52,075 INFO L225 Difference]: With dead ends: 7536 [2019-12-27 21:38:52,076 INFO L226 Difference]: Without dead ends: 3579 [2019-12-27 21:38:52,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:38:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2019-12-27 21:38:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 2985. [2019-12-27 21:38:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2019-12-27 21:38:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 8598 transitions. [2019-12-27 21:38:52,122 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 8598 transitions. Word has length 67 [2019-12-27 21:38:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:52,122 INFO L462 AbstractCegarLoop]: Abstraction has 2985 states and 8598 transitions. [2019-12-27 21:38:52,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:38:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 8598 transitions. [2019-12-27 21:38:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:38:52,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:52,126 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 21:38:52,127 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 21:38:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1052432089, now seen corresponding path program 2 times [2019-12-27 21:38:52,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:52,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937744039] [2019-12-27 21:38:52,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:38:53,857 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 21:38:53,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937744039] [2019-12-27 21:38:53,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:38:53,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:38:53,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [455873017] [2019-12-27 21:38:53,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:38:53,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:38:53,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 180 transitions. [2019-12-27 21:38:53,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:38:53,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:38:53,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:38:53,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:38:53,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:38:53,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:38:53,986 INFO L87 Difference]: Start difference. First operand 2985 states and 8598 transitions. Second operand 3 states. [2019-12-27 21:38:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:38:54,019 INFO L93 Difference]: Finished difference Result 2800 states and 7840 transitions. [2019-12-27 21:38:54,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:38:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 21:38:54,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:38:54,025 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 21:38:54,025 INFO L226 Difference]: Without dead ends: 2800 [2019-12-27 21:38:54,026 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 21:38:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-12-27 21:38:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2604. [2019-12-27 21:38:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2604 states. [2019-12-27 21:38:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 7309 transitions. [2019-12-27 21:38:54,104 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 7309 transitions. Word has length 67 [2019-12-27 21:38:54,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:38:54,104 INFO L462 AbstractCegarLoop]: Abstraction has 2604 states and 7309 transitions. [2019-12-27 21:38:54,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:38:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 7309 transitions. [2019-12-27 21:38:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 21:38:54,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:38:54,110 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 21:38:54,111 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 21:38:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:38:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1034762219, now seen corresponding path program 1 times [2019-12-27 21:38:54,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:38:54,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147020625] [2019-12-27 21:38:54,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:38:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:38:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:38:54,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:38:54,341 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:38:54,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24|) |v_ULTIMATE.start_main_~#t1403~0.offset_18| 0)) |v_#memory_int_19|) (= 0 v_~x$r_buff0_thd0~0_84) (= 0 v_~x$w_buff1~0_25) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1403~0.base_24|) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~x$r_buff0_thd3~0_22) (= |v_#NULL.offset_3| 0) (= 0 v_~x$r_buff0_thd1~0_22) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0~0_26) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x~0_29 0) (= 0 v_~weak$$choice2~0_36) (= 0 v_~x$r_buff0_thd2~0_30) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$r_buff1_thd1~0_20 0) (= v_~x$mem_tmp~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24|) 0) (= v_~x$w_buff1_used~0_72 0) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z~0_9) (= 0 v_~x$w_buff0_used~0_118) (= v_~x$r_buff1_thd0~0_54 0) (= 0 |v_ULTIMATE.start_main_~#t1403~0.offset_18|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1403~0.base_24| 4) |v_#length_21|) (= v_~x$r_buff1_thd3~0_20 0) (= v_~x$r_buff1_thd2~0_20 0) (= v_~y~0_11 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_8|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_~#t1403~0.base=|v_ULTIMATE.start_main_~#t1403~0.base_24|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_12|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_12|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_29, ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_8|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ~y~0=v_~y~0_11, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_18|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_54, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1403~0.offset=|v_ULTIMATE.start_main_~#t1403~0.offset_18|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1403~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_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1405~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~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_#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, ULTIMATE.start_main_~#t1404~0.offset, ~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_~#t1405~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_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1403~0.offset, ULTIMATE.start_main_~#t1404~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:38:54,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1404~0.base_11| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1404~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1404~0.offset_9|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11|) |v_ULTIMATE.start_main_~#t1404~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1404~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1404~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1404~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:38:54,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1405~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1405~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1405~0.base_11| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11| 1)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1405~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11|) |v_ULTIMATE.start_main_~#t1405~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1405~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1405~0.base, #length] because there is no mapped edge [2019-12-27 21:38:54,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L4-->L764: Formula: (and (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-20219747 0)) (= ~x$r_buff1_thd2~0_Out-20219747 ~x$r_buff0_thd2~0_In-20219747) (= ~x$r_buff0_thd3~0_In-20219747 ~x$r_buff1_thd3~0_Out-20219747) (= 1 ~x$r_buff0_thd2~0_Out-20219747) (= ~x$r_buff1_thd1~0_Out-20219747 ~x$r_buff0_thd1~0_In-20219747) (= ~__unbuffered_p1_EAX~0_Out-20219747 ~y~0_In-20219747) (= ~x$r_buff1_thd0~0_Out-20219747 ~x$r_buff0_thd0~0_In-20219747)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-20219747, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-20219747, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-20219747, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-20219747, ~y~0=~y~0_In-20219747, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-20219747} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-20219747, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-20219747, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-20219747, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-20219747, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-20219747, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-20219747, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-20219747, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-20219747, ~y~0=~y~0_In-20219747, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-20219747, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-20219747} 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 21:38:54,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In51588138 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In51588138 256)))) (or (and (= ~x$w_buff1~0_In51588138 |P2Thread1of1ForFork2_#t~ite15_Out51588138|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In51588138 |P2Thread1of1ForFork2_#t~ite15_Out51588138|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In51588138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In51588138, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In51588138, ~x~0=~x~0_In51588138} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out51588138|, ~x$w_buff1~0=~x$w_buff1~0_In51588138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In51588138, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In51588138, ~x~0=~x~0_In51588138} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 21:38:54,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_18) 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_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 21:38:54,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-550471011 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-550471011 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-550471011 |P2Thread1of1ForFork2_#t~ite17_Out-550471011|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-550471011|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-550471011, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-550471011} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-550471011, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-550471011|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-550471011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 21:38:54,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1687643965 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1687643965 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1687643965 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1687643965 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1687643965 |P2Thread1of1ForFork2_#t~ite18_Out-1687643965|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1687643965|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687643965, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1687643965, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1687643965, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687643965} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687643965, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1687643965, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1687643965, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1687643965|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687643965} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 21:38:54,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1865778322 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1865778322 256) 0))) (or (and (= ~x$w_buff1~0_In1865778322 |P0Thread1of1ForFork0_#t~ite3_Out1865778322|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In1865778322 |P0Thread1of1ForFork0_#t~ite3_Out1865778322|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1865778322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1865778322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1865778322, ~x~0=~x~0_In1865778322} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1865778322|, ~x$w_buff1~0=~x$w_buff1~0_In1865778322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1865778322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1865778322, ~x~0=~x~0_In1865778322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 21:38:54,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_19 |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_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 21:38:54,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1948219065 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1948219065 256) 0))) (or (and (= ~x$w_buff0_used~0_In1948219065 |P0Thread1of1ForFork0_#t~ite5_Out1948219065|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1948219065|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1948219065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1948219065} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1948219065|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1948219065, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1948219065} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:38:54,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1649887059 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1649887059 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1649887059 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1649887059 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1649887059| ~x$w_buff1_used~0_In-1649887059) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1649887059| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649887059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649887059, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649887059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649887059} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1649887059|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1649887059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1649887059, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1649887059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1649887059} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:38:54,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2089003837 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2089003837 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out2089003837| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out2089003837| ~x$r_buff0_thd1~0_In2089003837) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2089003837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2089003837} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2089003837, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2089003837|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2089003837} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:38:54,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-49884210 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-49884210 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-49884210 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-49884210 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-49884210| ~x$r_buff1_thd1~0_In-49884210)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-49884210| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-49884210, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-49884210, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-49884210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-49884210} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-49884210, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-49884210|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-49884210, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-49884210, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-49884210} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:38:54,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} 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_16, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} 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 21:38:54,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1865257425 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1865257425 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1865257425|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1865257425 |P1Thread1of1ForFork1_#t~ite11_Out1865257425|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1865257425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1865257425} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1865257425|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1865257425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1865257425} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:38:54,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In329719444 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In329719444 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In329719444 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In329719444 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out329719444|)) (and (= ~x$w_buff1_used~0_In329719444 |P1Thread1of1ForFork1_#t~ite12_Out329719444|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In329719444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In329719444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In329719444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In329719444} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In329719444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In329719444, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out329719444|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In329719444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In329719444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:38:54,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1284481375 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1284481375 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1284481375 ~x$r_buff0_thd2~0_In1284481375)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out1284481375 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1284481375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1284481375} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1284481375|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1284481375, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1284481375} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:38:54,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-551171063 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-551171063 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-551171063 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-551171063 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-551171063|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In-551171063 |P1Thread1of1ForFork1_#t~ite14_Out-551171063|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-551171063, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-551171063, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-551171063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551171063} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-551171063, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-551171063, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-551171063, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-551171063|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551171063} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:38:54,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ 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_14, ~__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 21:38:54,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-798976330 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-798976330 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-798976330| ~x$r_buff0_thd3~0_In-798976330) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-798976330| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798976330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798976330} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798976330, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-798976330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798976330} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 21:38:54,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In100487237 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In100487237 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In100487237 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In100487237 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In100487237 |P2Thread1of1ForFork2_#t~ite20_Out100487237|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out100487237|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In100487237, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In100487237, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In100487237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In100487237} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out100487237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In100487237, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In100487237, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In100487237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In100487237} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 21:38:54,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L788-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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 21:38:54,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:38:54,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1761619350 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1761619350 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1761619350| |ULTIMATE.start_main_#t~ite25_Out1761619350|))) (or (and (= ~x~0_In1761619350 |ULTIMATE.start_main_#t~ite24_Out1761619350|) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite24_Out1761619350| ~x$w_buff1~0_In1761619350) (not .cse1) (not .cse2) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1761619350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1761619350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1761619350, ~x~0=~x~0_In1761619350} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1761619350, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1761619350|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1761619350|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1761619350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1761619350, ~x~0=~x~0_In1761619350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 21:38:54,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1240948582 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1240948582 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1240948582 |ULTIMATE.start_main_#t~ite26_Out-1240948582|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1240948582|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1240948582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240948582} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1240948582, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1240948582|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240948582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 21:38:54,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In220663219 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In220663219 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In220663219 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In220663219 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out220663219| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out220663219| ~x$w_buff1_used~0_In220663219)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In220663219, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220663219, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In220663219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220663219} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In220663219, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220663219, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out220663219|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In220663219, ~x$w_buff0_used~0=~x$w_buff0_used~0_In220663219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 21:38:54,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1728433083 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1728433083 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out1728433083|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1728433083 |ULTIMATE.start_main_#t~ite28_Out1728433083|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1728433083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728433083} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1728433083, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1728433083|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728433083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 21:38:54,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-703972886 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-703972886 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-703972886 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-703972886 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-703972886| ~x$r_buff1_thd0~0_In-703972886)) (and (= |ULTIMATE.start_main_#t~ite29_Out-703972886| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-703972886, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-703972886, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-703972886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703972886} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-703972886, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-703972886|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-703972886, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-703972886, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-703972886} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:38:54,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L832-->L832-8: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2052843672 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-2052843672 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2052843672 256))) (.cse4 (= 0 (mod ~x$r_buff1_thd0~0_In-2052843672 256))) (.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-2052843672| |ULTIMATE.start_main_#t~ite44_Out-2052843672|)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-2052843672 256)))) (or (and (or (and (= |ULTIMATE.start_main_#t~ite45_Out-2052843672| ~x$w_buff1_used~0_In-2052843672) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-2052843672| |ULTIMATE.start_main_#t~ite44_In-2052843672|)) (and .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5 (= |ULTIMATE.start_main_#t~ite44_Out-2052843672| ~x$w_buff1_used~0_In-2052843672))) (= |ULTIMATE.start_main_#t~ite43_In-2052843672| |ULTIMATE.start_main_#t~ite43_Out-2052843672|)) (let ((.cse6 (not .cse2))) (and (= |ULTIMATE.start_main_#t~ite44_Out-2052843672| |ULTIMATE.start_main_#t~ite43_Out-2052843672|) (not .cse1) .cse0 (or .cse6 (not .cse3)) (or (not .cse4) .cse6) (= |ULTIMATE.start_main_#t~ite43_Out-2052843672| 0) .cse5)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2052843672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2052843672, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2052843672, ~weak$$choice2~0=~weak$$choice2~0_In-2052843672, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-2052843672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2052843672, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-2052843672|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2052843672, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2052843672, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2052843672, ~weak$$choice2~0=~weak$$choice2~0_In-2052843672, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2052843672|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2052843672|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2052843672|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2052843672} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:38:54,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L833-->L834: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26} 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 21:38:54,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L834-->L834-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite51_Out862666443| |ULTIMATE.start_main_#t~ite50_Out862666443|)) (.cse4 (= 0 (mod ~x$r_buff1_thd0~0_In862666443 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In862666443 256))) (.cse6 (= (mod ~x$r_buff0_thd0~0_In862666443 256) 0)) (.cse5 (= (mod ~x$w_buff1_used~0_In862666443 256) 0)) (.cse2 (= 0 (mod ~weak$$choice2~0_In862666443 256)))) (or (let ((.cse3 (not .cse6))) (and .cse0 (= |ULTIMATE.start_main_#t~ite49_Out862666443| 0) (not .cse1) .cse2 (or .cse3 (not .cse4)) (or .cse3 (not .cse5)) (= |ULTIMATE.start_main_#t~ite49_Out862666443| |ULTIMATE.start_main_#t~ite50_Out862666443|))) (and (or (and .cse0 (= ~x$r_buff1_thd0~0_In862666443 |ULTIMATE.start_main_#t~ite50_Out862666443|) .cse2 (or (and .cse6 .cse4) .cse1 (and .cse6 .cse5))) (and (= |ULTIMATE.start_main_#t~ite50_In862666443| |ULTIMATE.start_main_#t~ite50_Out862666443|) (= ~x$r_buff1_thd0~0_In862666443 |ULTIMATE.start_main_#t~ite51_Out862666443|) (not .cse2))) (= |ULTIMATE.start_main_#t~ite49_In862666443| |ULTIMATE.start_main_#t~ite49_Out862666443|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In862666443|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In862666443, ~x$w_buff1_used~0=~x$w_buff1_used~0_In862666443, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_In862666443|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In862666443, ~weak$$choice2~0=~weak$$choice2~0_In862666443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In862666443} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out862666443|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In862666443, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out862666443|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In862666443, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out862666443|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In862666443, ~weak$$choice2~0=~weak$$choice2~0_In862666443, ~x$w_buff0_used~0=~x$w_buff0_used~0_In862666443} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:38:54,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L836-->L839-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_24) (= (mod v_~main$tmp_guard1~0_5 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 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_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_5, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_24, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:38:54,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L839-1-->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 21:38:54,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:38:54 BasicIcfg [2019-12-27 21:38:54,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:38:54,483 INFO L168 Benchmark]: Toolchain (without parser) took 92924.15 ms. Allocated memory was 137.4 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 516.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,484 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.71 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.8 MB in the beginning and 155.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.49 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,486 INFO L168 Benchmark]: Boogie Preprocessor took 52.25 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,487 INFO L168 Benchmark]: RCFGBuilder took 882.74 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 99.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,487 INFO L168 Benchmark]: TraceAbstraction took 91060.91 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 450.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:38:54,497 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.71 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.8 MB in the beginning and 155.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.49 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.25 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 882.74 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 99.9 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91060.91 ms. Allocated memory was 202.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 450.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 91912 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L809] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L778] 3 y = 1 [L781] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z=1] [L735] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 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 [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 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) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 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 [L786] 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 [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 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 [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 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 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L828] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L828] 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) [L829] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L829] 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)) [L830] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L830] 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)) [L831] 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=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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] [L831] 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)) [L832] 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)) [L834] 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)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 90.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1838 SDtfs, 1825 SDslu, 2615 SDs, 0 SdLazy, 1260 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 29 SyntacticMatches, 18 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192443occurred 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: 46.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 69289 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 60165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...